There is a variation of the bubble sort algorithm called a gap sort that, rather than comp...

There is a variation of the bubble sort algorithm called a gap sort that, rather than comparing neighboring elements each time throughthe list, compares elements that are some number i positions apart,where i is an integer less than n. For example, the first elementwould be compared to the (i + 1) element, the second elementwould be compared to the (i + 2) element, the nth element wouldbe compared to the (n - i) element, and so on. A single iteration iscompleted when all of the elements that can be compared, havebeen compared. On the next iteration, i is reduced by somenumber greater than 1 and the process continues until i is lessthan 1. Implement a gap sort.