Question

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.

in C please

Answer 1

void shakerSort(int a[], int n)

{

    bool swapped = true;

    int start = 0;

    int end = n - 1;

  

    while (swapped) {

        swapped = false;

        for (int i = start; i < end; ++i) {

            if (a[i] > a[i + 1]) {

                swap(a[i], a[i + 1]);

                swapped = true;

            }

        }

        if (!swapped)

            break;

        swapped = false;

        --end;

        for (int i = end - 1; i >= start; --i) {

            if (a[i] > a[i + 1]) {

                swap(a[i], a[i + 1]);

                swapped = true;

            }

        }

        ++start;

    }

}