C++ Program for implementation of Quick Sort using array

By | 27.12.2016

Quick Sort using array


Write a C++ Program for implementation of Quick Sort using array. Here’s simple Program for implementation of Quick Sort using array in C++ Programming Language.


What is an Array ?


Arrays a kind of data structure that can store a fixed-size sequential collection of elements of the same type. An array is used to store a collection of data, but it is often more useful to think of an array as a collection of variables of the same type.

Instead of declaring individual variables, such as number0, number1, …, and number99, you declare one array variable such as numbers and use numbers[0], numbers[1], and …, numbers[99] to represent individual variables. A specific element in an array is accessed by an index.

All arrays consist of contiguous memory locations. The lowest address corresponds to the first element and the highest address to the last element.


Here is source code of the C++ Program for implementation of Quick Sort using array. The C++ program is successfully compiled and run on a Windows system. The program output is also shown in below.


SOURCE CODE : :


 

/*  C++ Program for implementation of Quick Sort using array  */

#include <iostream>

using namespace std;

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

int main()
{
    int a[50],n,i;

    cout<<"Enter size of Array :: ";
    cin>>n;
    cout<<"\nEnter elements to the array :: \n";

    for(i=0;i<n;++i)
    {
        cout<<"\nEnter "<<i+1<<" element :: ";
        cin>>a[i];
    }


    quick_sort(a,0,n-1);
    cout<<"\nAfter Quick Sort, Sorted List is :: \n\n";

    for(i=0;i<n;i++)
    {
         cout<<a[i]<<"  ";
    }

    cout<<"\n";

    return 0;
}

void quick_sort(int a[],int l,int u)
{
    int j;
    if(l<u)
    {
        j=partition(a,l,u);
        quick_sort(a,l,j-1);
        quick_sort(a,j+1,u);
    }
}

int partition(int a[],int l,int u)
{
    int v,i,j,temp;
    v=a[l];
    i=l;
    j=u+1;

    do
    {
        do
            i++;

        while(a[i]<v&&i<=u);

        do
            j--;
        while(v<a[j]);

        if(i<j)
        {
            temp=a[i];
            a[i]=a[j];
            a[j]=temp;
        }
    }while(i<j);

    a[l]=a[j];
    a[j]=v;

    return(j);
}

OUTPUT : :


/*  C++ Program for implementation of Quick Sort using array  */

Enter size of Array :: 6

Enter elements to the array ::

Enter 1 element :: 4

Enter 2 element :: 3

Enter 3 element :: 1

Enter 4 element :: 6

Enter 5 element :: 8

Enter 6 element :: 7

After Quick Sort, Sorted List is ::

1  3  4  6  7  8

Process returned 0

Above is the source code for C++ Program for implementation of Quick Sort using array which is successfully compiled and run on Windows System.The Output of the program is shown above .

If you found any error or any queries related to the above program or any questions or reviews , you wanna to ask from us ,you may Contact Us through our contact Page or you can also comment below in the comment section.We will try our best to reach up to you in short interval.


Thanks for reading the post….

0 0 votes
Article Rating
Category: Arrays Programs C++ Programming Tags: ,

About Tunde A

My name is Tunde Ajetomobi, a Tech Enthusiast and Growth Hacker. I enjoy creating helpful content that solves problem across different topics. Codezclub is my way of helping young aspiring programmers and students to hone their skills and find solutions on fundamental programming languages.

Subscribe
Notify of
guest

0 Comments
Inline Feedbacks
View all comments