Algorithm Analysis 2
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 0% Most missed: “Merge sort worst case complexity”
Algorithm Analysis 2
Time left 00:00
25 Questions

1. Hashing worst case complexity

2. Open address efficiency

3. Hashing best case complexity

4. Quick sort worst case complexity

5. Removing max from Heap

6. Linear search best case complexity

7. Insertion sort stability

8. Quick sort stability

9. Preorder

10. Linear search average case complexity

11. Quick sort usefulness

12. Cost of rehasing

13. Outdegree

14. Selection sort best case complexity

15. Insertion usefulness

16. Quick sort average case complexity

17. Linear search array type

18. Postorder

19. Inorder

20. Binary search average case complexity

21. Insertion sort worst case complexity

22. Selection sort average case complexity

23. Enqueue movement

24. Cost of open addressing for unsuccessful search

25. Insertion sort best case complexity