We have the slower algorithms selection sort,bubble sort and insertion sort typically all have quadratic runtimes when sorting data so as the dataset set increases the perfomance speed will suffer .

This algorithm works by running through the array and swapping a value for the next value along if that value is less than the current value. After the first run through the highest value in the array ...