What are the uses of different sorting algorithms like bubble, selection, insertion, shell, merge, heap, quick, tree, radix, counting and bucket sort in real-life scenarios?
Which of the following is the fastest to sort a list: merge, shell, bubble, insertion, selection or quick sort?