Quiz
Sorting Algorithms
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (17)
1What is the space complexity of InsertionSort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
2What is the worst-case time complexity of InsertionSort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
3What is the best-case time complexity of InsertionSort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
4What is the average-case time complexity of InsertionSort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
5What is the best-case time complexity of Bubble Sort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
6What is the space complexity of Bubble Sort?
- AO(1)
- BO(logn)
- CO(nlogn)
- DO(n)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
7What is the worst-case time complexity of Bubble Sort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
8What is the time complexity of Selection Sort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
9What is the space complexity of Selection Sort?
- AO(1)
- BO(logn)
- CO(nlogn)
- DO(n)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
10What is the average-case time complexity of Mergesort?
- AO(1)
- BO(nlogn)
- CO(n)
- DO(logn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
11What is the worst-case time complexity of Mergesort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(2^n)
- HO(n!)
12What is the space complexity of Mergesort?
- AO(1)
- BO(logn)
- CO(nlogn)
- DO(n)
- EO(n^3)
- FO(n^2)
- GO(n!)
- HO(2^n)
13What is the best-case space complexity of Quicksort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
14what is the worst-case space complexity of Quicksort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
15What is the worst-case time complexity of Quicksort
- AO(1)
- BO(n)
- CO(logn)
- DO(nlogn)
- EO(n!)
- FO(2^n)
- GO(n^2)
- HO(n^3)
16Whats the average-case time complexity of Quicksort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n!)
- FO(2^n)
- GO(n^2)
- HO(n^3)
17What is the best-case time complexity of Quicksort?
- AO(1)
- BO(logn)
- CO(n)
- DO(nlogn)
- EO(n^2)
- FO(n^3)
- GO(n!)
- HO(2^n)
Information
- Description
- Quiz on Sorting Algorithms, created by j.bothwell on 22/04/2015.
- Author
- j.bothwell
- Language
- English
- Views
- 6
- Rating
- No ratings yet Rate this quiz