Finally the results from “You think you know algorithms” are out. This time only 3 of you have answered correctly to all the questions.
1. Which string searching algorithm is faster?
- Morris-Pratt correct answer (ref)
- Brute force
- Rabin-Karp
2. Can you use radix sort for sorting floats?
- Yes
- No correct answer (ref)
3. Quicksort needs additional memory space?
- Yes
- No
- Only in iterative implementation correct answer (ref)
- Only in recursive implementation
4. In the worst case scenario which is slower?
- Quicksort
- Bubble sort
- They are equally slow correct answer (ref)
5. Is merge sort faster than quicksort in general?
- Yes, its complexity is O(n.log(n)) always!
- No, in practice quicksort is often faster than merge sort correct answer (ref)
Related posts:
