Scribd Logo
Upload

Welcome to Scribd!

  • Quick Sort

    Uploaded by

    Sushree sangita Barik
    4 views2 pages
    This C program implements the quicksort algorithm to sort an array of integers. It includes functions to swap array elements, partition the array around a pivot element, recursively call quicksort on each partition, and print the sorted array. The main function gets array size and elements from user, calls quicksort to sort the array, and prints the sorted results.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C program implements the quicksort algorithm to sort an array of integers. It includes functions to swap array elements, partition the array around a pivot element, recursively call quicksort on each partition, and print the sorted array. The main function gets array size and elements from user, calls quicksort to sort the array, and prints the sorted results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    4 views2 pages

    Quick Sort

    Uploaded by

    Sushree sangita Barik
    This C program implements the quicksort algorithm to sort an array of integers. It includes functions to swap array elements, partition the array around a pivot element, recursively call quicksort on each partition, and print the sorted array. The main function gets array size and elements from user, calls quicksort to sort the array, and prints the sorted results.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    #include<stdio.

    h>

    #include<conio.h>

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

    int partition(int [],int,int);

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

    //void printArray(int [],int,int);

    void swap(int A[],int i,int j){

    int temp;

    temp=A[i];

    A[i]=A[j];

    A[j]=temp;

    int partition(int A[],int S,int E){

    int pivot,i,j;

    pivot=A[E];

    i=S-1;

    for(j=0;j<E;j++){

    if(A[j]<=pivot){

    i+=1;

    swap(A,i,j);

    swap(A,i+1,E);

    return i+1;

    void quickSORT(int A[],int S,int E){

    int q;

    if(S<E){

    q=partition(A,S,E);

    quickSORT(A,S,q-1);

    quickSORT(A,q+1,E);
    }

    void main(){

    int A[20],i,Size;

    printf("Enter Size of the Array: ");

    scanf("%d",&Size);

    printf("Enter %d elements in array: \n",Size);

    for(i=0;i<Size;i++){

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

    quickSORT(A,0,Size-1);

    printf("The Sorted Array is: ");

    for(i=0;i<Size;i++){

    printf("%d\t",A[i]);

    getch();

    //printArray(A,S,E);

    You might also like