CS 1371

Big O notation for insertion sort

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

which sort is this?

if vec(i) < ret(j)
ret = [ret(1:j-1), vec(i), ret(j:end)];

Big O notation for bubble sorting?

which sort uses iteration and swaps?

this code describes which sort?

if vec(j) > vec(j+1)
tmp = vec(j+1);
vec(j+1) = vec(j);
vec(j) = tmp;

when does the worst case of quick sort take place?

what is the big O for quick sort?

which sort uses recursion with logical indexing?

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)];

what is the big O for merge sort?

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

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);

units of fs?

units for duration?

units for s

what is the max frequency you can represent ?

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