No abstract.
Providing an example and explaining how it works; Describing how tail recursion works and how it differs from regular recursion.
Provide at least one advantage and disadvantage of using recursion compared to iteration, Provide examples to support your points.
Finally, if the provided function is not tail recursive, explain how it could be modified to use tail recursion. If tail recursive, explain what makes it tail recursive.
Does it pertain to both Linear Probing and Separate Chaining collision resolution mechanisms? Explain how it can impact the performance of a hash table.
Give an example of how adjusting the load factor can improve the performance for each. Linear Probing. Separate Chaining
Linear Probing Separate Chaining
Leave your answer below as a comment
What is the best-case and worst-case complexity of the below operations. Explain the reason for the best and worst case. No explanation no marks. search add delete
What is Linear Probing? Why and when is it used? What is the basic idea behind linear probing and how is it implemented? How does it handle a collision? How does it handle a conflict?