Today we are going to analyze a sorting algorithm that is not very efficient but often used in various fields. We are talking abou the Selection Sort.Let's have a look.IntuitionThe idea behind it is to divide the array to sort into two sub-arrays: the first that contains the sorted data and occupies the first positions of the array while the second contains the data that have to be sorted and it occupies tendentially the final positions of the array. At the beginning, the subsequence of sorted elements is empty while the subsequence that represents the unsorted elements occupies the entire…