Please write a c++ implimentation that returns a count of the steps through the sort. (do not worry about updating count, I will rewrite that segemnt. I need help with writing the shell sort.
- Shell sort ( diminishing increment sort ) with increments: hs = 2s - 1 , 1 <= s, where s equals floor(lg n)
- should look something like this ShellSort(array, file_size)
- if you are calling more then one function the count needs to be implemnted in such a way that it continues counting up
- please use the simplest c++ code, no fancy, and please comment the steps breifly