Sorting arrays using pointers.
If this program make any errors please let me know,i will try to help you out.
#include<iostream>
#include<conio.h>
using namespace std;
main()
{
int arraysize=5;
int a[arraysize],i,j,temp;
int *ptr,*ptr1;
cout<<"enter values in array:"<<endl;
for(i=0;i<arraysize;i++)
{
cin>>a[i];
}
ptr=&a[0];
ptr1=&a[1];
for(i=0;i<arraysize;i++)
for(j=0;j<arraysize;j++)
{
if(*ptr>*ptr1)
{
temp=*ptr;
*ptr=*ptr1;
*ptr1=temp;
}
ptr++;
ptr1++;
}
cout<<"********Sorted array is***********"<<endl;
for(i=0;i<arraysize;i++)
cout<<*ptr++<<"\t";
getch();
return 0;
}
If this program make any errors please let me know,i will try to help you out.
#include<iostream>
#include<conio.h>
using namespace std;
main()
{
int arraysize=5;
int a[arraysize],i,j,temp;
int *ptr,*ptr1;
cout<<"enter values in array:"<<endl;
for(i=0;i<arraysize;i++)
{
cin>>a[i];
}
ptr=&a[0];
ptr1=&a[1];
for(i=0;i<arraysize;i++)
for(j=0;j<arraysize;j++)
{
if(*ptr>*ptr1)
{
temp=*ptr;
*ptr=*ptr1;
*ptr1=temp;
}
ptr++;
ptr1++;
}
cout<<"********Sorted array is***********"<<endl;
for(i=0;i<arraysize;i++)
cout<<*ptr++<<"\t";
getch();
return 0;
}
No comments:
Post a Comment