Our team came with the idea to solve the problem statement of students.So we solve a problem called as Quick Sort which is the part of Data structure."Quick Sort is basically used to sort an array of n elements.In this process we consider a key element in the initial stage and we imposed some instruction so that the new array create will place the key element to such a location so that at the left side  of key elements all the elements has less value than key element and on the right side of the key element all the elements has high value than the key element.The process continues until the array will be sort.Key element is the leftmost index of the array." In this blog we create a program to resolve the problem of students with the help of recursive functions.We use a Random function in our program so that we don't need to give input through keyboard that is compiler itself insert the inputs from buffer memory.So here you are guys.....Hope you like it..
If you like the program then please like our channel by clicking the link below and if you had any problem then you can ask our team anytime.

programmerix@gmail.com
Facebook_Page   youtube

<PROGRAM/CODE> 

#include<iostream.h>
#include<conio.h>
#include<stdlib.h>
int part(int[],int,int);
void input(int a[],int n)
{
int i;
//cout<<"\nEnter array elements:"<<endl;
randomize();
for(i=0;i<n;i++)
{
a[i]=rand()%100;

}
cout<<"\nArray is \n";
for(i=0;i<n;i++)
{
cout<<" "<<a[i];
}
}
void quick(int a[],int low,int high)
{
    int j;
    if(low<high)
    {
j=part(a,low,high);
quick(a,low,j-1);
quick(a,j+1,high);
    }
}

int part(int a[],int low,int high)
{
    int v,i,j,temp;
    v=a[low];
    i=low;
    j=high+1;

    do
    {
do
{
    i++;
}while(a[i]<v);
do
{
    j--;
}while(v<a[j]);
if(i<j)
{
    temp=a[i];
    a[i]=a[j];
    a[j]=temp;
}
    }while(i<j);

    a[low]=a[j];
    a[j]=v;

    return(j);
}
void display(int a[],int n)
{
int i;
cout<<"\nArray after sorting: \n\t\t    ";
for(i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
}
void main()
{
    int a[50],n,i,low,high;
    clrscr();
    cout<<"How many elements \n";
    cin>>n;
    input(a,n);
    low=0;
    high=n-1;
    quick(a,low,high);
    display(a,n);
getch();
}

Comments

Post a Comment

Popular posts from this blog

Network File System

Image
Network File System We designed a NFS server which helps us to transfer files and directories between a different systems in the same network.You can also designed your own NFS server by the help of our team Programmerix. We share some method with you so that you can make our own nfs server with the help of Redhat 7.3 operating system(Linux). 1)NFS:- Network File System is a server-client protocol used for sharing the files bwteeen computers on a common network. We can directly access to any files on the remote file system. NFS protocol can't be run on Windows operating system because Window is not NFS compatible. Rather than NFS we use SAMBA protocol on windows to transfer the files. 2)Steps:-  ⦁ On Server(redhat 7.3):- 1) install the software **NFS_UTILS** -------yum install -y nfs-utils 2)Configure nfs server ------- create a directory like data(or any name) anywhere ------- now open the file /etc/exports vim /etc/exports -------- ...
Read more

Fibonacci Series with Python

Image
Fibonacci Series  F ibonacci Series  are the numbers in the following   integer sequence , called the  Fibonacci series  , and characterized by the fact that every number after the first two is the sum of the two preceding ones:- {\displaystyle 1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\;\ldots }       Often, especially in modern usage, the sequence is extended by one more initial term: {\displaystyle 0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\;\ldots } By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two. <PROGRAM> def fibo():     a=int(0)     b=int(1)     list=[]     list.append(a)     list.append(b)     for i in range(2,5):         k=a+b   ...
Read more
Image
----MERGE SORT---- M erge Sort is a Divide and conqueror problem.  It divides an input array in two halves, calls itself for the two halves and then merges the two sorted halves.   The merge() function  is used for merging two halves.It follows the top-down approach.  Our Team "Programmerix" has created our own version of Merging code so that we can solve many students problem.We use recursive function and random function this code to help the programmers to insert the inputs via keyboard.Hope you all like it----- Gmail ----Program---- #include<iostream.h> #include<conio.h> #include<stdlib.h> void Merge(int [],int,int,int); void input(int a[],int n) { int i; randomize(); for(i=0;i<n;i++) { a[i]=rand()%100; } cout<<"array is \n"; for(i=0;i<n;i++) { cout<<" "<<a[i]; } cout<<endl; } void Ms(int a[],int low,int high) { int mid; if(low<high) { mid=(low+high)...
Read more