Algorithms Flashcards
Selection Sort
Time Complexity
Average: O(n2)
Worst: O(n2)
Quicksort
Time Complexity
Average: O(n log n)
Worst: O(n2)
Insertion Sort
Space Complexity
O(1)
Bubble Sort
Space Complexity
O(1)
Insertion Sort
Time Complexity
Average: O(n2)
Worst: O(n2)
Radix Sort
Space Complexity
O(n+k)
Heapsort
Space Complexity
O(1)
Mergesort
Space Complexity
O(n)
Bubble Sort
Time Complexity
Average: O(n2)
Worst: O(n2)
Bucket Sort
Time Complexity
Average: O(n + k)
Worst: O(n2)
Mergesort
Time Complexity
Average: O(n log n)
Worst: O(n log n)
Radix Sort
Time Complexity
Average: O(nk)
Worst: O(nk)
Heapsort
Time Complexity
Average: O(n log n)
Worst: O(n log n)
Quicksort
Space Complexity
O(log n)
Bucket Sort
Space Complexity
O(n)
Selection Sort
Space Complexity
O(1)