Question

Differentiate between ordered list and sorted list in c programming

Answer 1

Explanation:

The memory of SortedList is an overhead. The memory of SortedDictionary is not bottlenecked.

In SortedList, the elements are stored in a continuous block in memory. In SortedDictionary, the elements are stored in separate object that can spread all over the heap.

In SoterdList, the memory fragmentation is high. In SoterdDictionary, the memory fragmentation is low.

It require less memory for storage. It require more memory for storage.

In SortedList, less inserts and delete operations are required. In SortedDictionary, more inserts and delete operations are required.

In SortedList, you can access elements using the index. In SortedDictionary, you can access elements using index or key. Here key access is sufficient there is no need of accessing elements using index.

In SortedList, data are already in sorted form. In SortedDictionary, data are in un-sorted