sort-code 01_bubble_sort best case O(n), worst case O(n^2) 02_merge_sort_recurrence Time complexity is O(nlog(n)) 02_merge_sort_non_recurrence Time complexity is O(nlog(n)) 03_quick_sort_recurrence average time complexity is O(nlog(n)), worst case time complexity is O(nlog(n))