A few computer science students have recently developed a great enthusiasm for fishing with fish hooks tied to fishing lines, a technique known as angling. Their passion has led to the creation of a group known as $"-$ The Fishermen". In order to go on their first adventure they thought, what if they could find the appropriate fishing spot? Their strategy was to measure the density of fish movement by analyzing satellite imagery. They performed a process to measure the amount of plankton and fish movements in each water cluster from various water bodies and converted them into integer values not greater than $10[$Higher is Better$]$ as fish density. After the measurement, they found around n clusters $(1000<=$ n $<=10000000).$ Now suggest the community the perfect sorting algorithm that can sort those n clusters to get the cluster with the highest fish density and let them know why it is the best choice for them in the fastest possible way.