Q1. prepare down a recursive algorithm to sort a list of given 10 integers by using quick sort.
10, 23, 11, 55, 32, 5, 67, 53, 4, 98
Also trace the working of your algorithm.
Q2. describe why recursive algorithm is slower as compared to its corresponding iterative algorithm?
Q3. Describe the AVL trees.
Q4. How the binary trees are symbolized in the memory?
Q5. What do you mean by collision in the Hash search? Give two techniques to resolve the collision.