Perform Quick Sort on a set of Entries from a File using Recursion

#include

#include

void quicksort (int [], int, int);

int main()

    int list[50];

    int size, i;

    clrscr();

    printf("Enter the number of elements: ");

    scanf("%d", &size);

    printf("Enter the elements to be sorted:\n");

    for (i = 0; i < size; i++)

        scanf("%d", &list[i]);

    quicksort(list, 0, size - 1);

    printf("After applying quick sort\n");

    for (i = 0; i < size; i++)

        printf("%d ", list[i]);

    printf("\n");

    return 0;

void quicksort(int list[], int low, int high)

    int pivot, i, j, temp;

    if (low < high)

        pivot = low;

        i = low;

        j = high;

        while (i < j)

            while (list[i] <= list[pivot] && i <= high)

                i++;

            while (list[j] > list[pivot] && j >= low)

                j--;

            if (i < j)

                temp = list[i];

                list[i] = list[j];

                list[j] = temp;

        temp = list[j];

        list[j] = list[pivot];

        list[pivot] = temp;

        quicksort(list, low, j - 1);

        quicksort(list, j + 1, high);

Output

Enter the number of elements: 6

Enter the elements to be sorted:

After applying quick sort

12 24 38 45 67 98

#include

#include

void quicksort (int [], int, int);

int main()

    int list[50];

    int size, i;

    clrscr();

    printf("Enter the number of elements: ");

    scanf("%d", &size);

    printf("Enter the elements to be sorted:\n");

    for (i = 0; i < size; i++)

        scanf("%d", &list[i]);

    quicksort(list, 0, size - 1);

    printf("After applying quick sort\n");

    for (i = 0; i < size; i++)

        printf("%d ", list[i]);

    printf("\n");

    return 0;

void quicksort(int list[], int low, int high)

    int pivot, i, j, temp;

    if (low < high)

        pivot = low;

        i = low;

        j = high;

        while (i < j)

            while (list[i] <= list[pivot] && i <= high)

                i++;

            while (list[j] > list[pivot] && j >= low)

                j--;

            if (i < j)

                temp = list[i];

                list[i] = list[j];

                list[j] = temp;

        temp = list[j];

        list[j] = list[pivot];

        list[pivot] = temp;

        quicksort(list, low, j - 1);

        quicksort(list, j + 1, high);

Output

Enter the number of elements: 6

Enter the elements to be sorted:

After applying quick sort

12 24 38 45 67 98

Solve Tower-of-Hanoi Problem using Recursion

#include

#include

void towers(int, char, char, char);

 int main()

    int num;

    clrscr();

    printf("Enter the number of disks : ");

    scanf("%d", &num);

    printf("The sequence of moves involved in the Tower of Hanoi are :\n");

    towers(num, 'A', 'C', 'B');

    return 0;

void towers(int num, char frompeg, char topeg, char auxpeg)

    if (num == 1)

        printf("\n Move disk 1 from peg %c to peg %c", frompeg, topeg);

        return;

    towers(num - 1, frompeg, auxpeg, topeg);

    printf("\n Move disk %d from peg %c to peg %c", num, frompeg, topeg);

    towers(num - 1, auxpeg, topeg, frompeg);

Output

Enter the number of disks : 3

The sequence of moves involved in the Tower of Hanoi are :

Move disk 1 from peg A to peg C

Move disk 2 from peg A to peg B

Move disk 1 from peg C to peg B

Move disk 3 from peg A to peg C

Move disk 1 from peg B to peg A

Move disk 2 from peg B to peg C

Move disk 1 from peg A to peg C

#include

#include

void copy(char [], char [], int);

int main()

    char str1[20], str2[20];

    clrscr();

    printf("Enter string to copy: ");

    scanf("%s", str1);

    copy(str1, str2, 0);

    printf("Copying success.\n");

    printf("The first string is: %s\n", str1);

    printf("The second string is: %s\n", str2);

    return 0;

void copy(char str1[], char str2[], int index)

    str2[index] = str1[index];

    if (str1[index] == '\0')

        return;

    copy(str1, str2, index + 1);

Output

Enter string to copy: sanfoundry

Copying success.

The first string is: sanfoundry

The second string is: sanfoundry