Question

what is the best sorting technique in data structures

Answer 1

In general, the technique having less average case complexity is considered to be better. So out of the popular techniques used, Merge Sort - GeeksQuiz is considered to be better because its’s performance is O(nlogn) even in the worst case. But depending on the structure the data is stored and the type of data, there could be some other algorithm performing better(e.g. Tree sort ).

Quicksort is also a very good technique which is based on the pivot selection and partioning of the dataset which performs in O(log n) in average case. But in the worst case, it has performance of O(n^2).