You think you know ... algorithms?

Which string searching algorithm is faster? *

Morris-Pratt

Brute force

Rabin-Karp

Can you use radix sort for sorting floats? *

Yes

No

Quicksort needs additional memory space? *

Yes

No

Only in iterative implementation

Only in recursive implementation

In the worst case scenario which is slower? *

Quicksort

Bubble sort

They are equally slow

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