1/13
scary
Name | Mastery | Learn | Test | Matching | Spaced |
|---|
No study sessions yet.
#of possible swaps in bubble sort
n(n-1)/2
#of possible swaps in selection sort
n-1
selection sort best runtime
o(n)
quick sort best runtime
o(n*logn)
quick sort worst runtime
o(n²)
bubble sort best runtim
o(n)
merge sort best runtime
o(nlogn)
merge sort worst runtime
o(nlogn)
insertion sort best runtime
o(n)
insertion sort worst runtime
o(n²)
bubble sort worst runtime
o(n²)bin
binary search best case
o(1)
binary search worst case
o(logn)
selection sort worst case
o(n²)