in C please 20. Change the bubble sort algorithm (Program 12-5) as follows: Use two directional…

in C please

20. Change the bubble sort algorithm (Program 12-5) as follows: Use two directional bubbling in each pass. In the first bubbling, the smallest ele. ment is bubbled up; in the second bubbling, the largest element is bubbled I down. This sort is known as the shaker sort. 12-5 Bubble Sort (continued) // Statements // Each iteration is one sort pass for (int current = 0, sorted = 0; current <= last && !sorted; current++) for (int walker = last, sorted = 1; walker current; walker--) if (list[ walker ] < list[ walker - 1 ) // Any exchange means list is not sorted sorted = 0; temp = list[walker); list[walker] = list[walker - 1); list[walker - 1] = temp; } // if return; // bubbleSort }