• Jump search
• Binary search correct answer
• Interpolation search

• O(log(n*n))
• O(log(n)) correct answer
• O(n*log(n))

3. Which search algorithm is faster?

• Binary search correct answer
• Fibonacci search

4. Which is better for natural language encoding?

• Run-length encoding
• Diagram encoding
• Pattern substitution correct answer

5. What is the complexity of searching into a hash table?

• Quadratic
• Logaritmic
• Linear

Note! – here (my fault) there’s no correct answer. The correct answer is that searching into a hash table has constant complexity – O(1). However I’ll assume that all of you that answered with “Linear” are right!