Chapter 13 Flashcards
1
Q
What is the fastest sorting algorithms
A
Quicksort
2
Q
What strategy quicksort follows
A
divide and conquer
3
Q
What is the worst case time for quicksort
A
O(n2)
Fundamentals of Algorithms - CS502 > Chapter 13 > Flashcards
What is the fastest sorting algorithms
Quicksort
What strategy quicksort follows
divide and conquer
What is the worst case time for quicksort
O(n2)
Fundamentals of Algorithms - CS502 (40 decks)