C++ de buyukten kucuge dogru siralama pointerler kullanarak yapilmistir
#include<iostream>
#include<iomanip>
using namespace std;
void bubblesort(int* ,const int);
void swap(int* const, int* const);
int main()
{
const int LEN=10;
int a[10];
cout<<"Pls enter arrary values::"<<endl;
for(int i=0;i<10;i++){
cin>>a[i];
cout<<i+1<<"==>a["<<i<<"]="<<a[i]<<endl;
}
bubblesort(a,LEN);
for(i=0;i<10;i++)
cout<<setw(4)<<a[i];
return 0;
}
void bubblesort(int* arr,const int LEN)
{
for(int i=0;i<LEN-1;i++)
for(int j=0;j<LEN-1;j++)
if(arr[j]>arr[j+1])
swap(&arr[j],&arr[j+1]);
}
void swap(int* const element1,int* const element2){
int temp=*element1;
*element1=*element2;
*element2=temp;
}
C++ Sorting
C++ Sorting
Konuyu Okuyanlar: 1 Ziyaretçi
![[Resim: 114ld.jpg]](http://b1112.hizliresim.com/s/c/114ld.jpg)