CS 1371
Home > Flashcards > Print Preview
The flashcards below were created by user
sberninghaus3
on
FreezingBlue Flashcards. What would you like to do?

Big O notation for insertion sort
O(N.^2)

which sort uses iteration and puts new vector in proper order with respect to items already put there?
Insertion Sort

which sort is this?
if vec(i) < ret(j)
ret = [ret(1:j1), vec(i), ret(j:end)];
insertion sort

Big O notation for bubble sorting?
O(N.^2)

which sort uses iteration and swaps?
bubble sort

this code describes which sort?
if vec(j) > vec(j+1)
tmp = vec(j+1);
vec(j+1) = vec(j);
vec(j) = tmp;
bubble sorting

when does the worst case of quick sort take place?
when the vector is already sorted.

what is the big O for quick sort?
O(N*log(N))

which sort uses recursion with logical indexing?
quick sort

which sort method does this code describe?
A= vec(1);
down= vec(vec < pivot);
up= vec(vec > pivot);
one= vec(vec == pivot);
ret = [black(down), one, black(up)];
quick sort

what is the big O for merge sort?
O(N*log(N))

which sort method uses recursion and cuts the vector in half?
merge sort

which sort method is described by this code?
A =black(vec(1:round(end/2)));
B = black(vec(round(end/2)+1:end));
ret = black(A, B);
merge sort

units of fs?
samples / seconds

units for duration?
seconds


what is the max frequency you can represent ?
fs / 2

how would you find out how many seconds were between consecutive time intervals?
1 / fs