assume that a list contains about thousand records inrandom order discuss which sorting method you would choose justifyyour answer
Answer
There’s no one algorithm that’s clearly the “best” algorithm. Itdepends on a bunch of factors.
For starters, can you fit your data into main memory? If youcan’t, then you’d need to rely on an external sorting algorithm.These algorithms are often based on quicksort and mergesort.
Second, do you know anything about your input distribution? Ifit’s mostly sorted, then something like Timsort might be a greatoption, since it’s designed to work well on sorted data. If it’smostly random, Timsort is probably not
OR
OR