#data-structures

Explain the "Quicksort" algorithm. Describe how it works step-by-step, its time and space complexity (best, average, and worst-case), and its main advantages and disadvantages compared to other sorting algorithms like Mergesort.

I need to store a collection of items where I will frequently be adding new items and searching for existing items. The order of items does not matter. What is the most appropriate data structure to use (e.g., Array, Linked List, Hash Table, Tree)? Explain the trade-offs and why your choice is the best for this scenario.