UNC COMP 410 final exam study questions and answers solved 2024

quick sort average case time complexity - n log n quick sort worst case time complexity - n^2 selection sort worst case time complexity - n^2 selection sort average case time complexity - n^2 merge sort worst case time complexity - n log n merge sort average case time complexity - n log n insertion sort worst case time complexity - n^2 insertion sort average case time complexity - n^2 skip list sort worst case time complexity - n^2 skip list sort average case time complexity - n log n of quick, selection, merge, insertion, and skip list, which is the only sort that has n log n and not n^2 time complexity in the worst case? - merge of quick, selection, merge, insertion, and skip list, which are the two only sorts that have n^2 instead of n log n time complexity in the average case? - selection and insertion worst case time complexity of printing all subsets of a set of size N - 2^n worst case time complexity of printing all shuffles of N different cards - n! worst case time complexity of adding to a skip list of n items - n