Search
 
 

Display results as :
 


Rechercher Advanced Search

Latest topics
» NewBlueFx TotalFX Windows-FL | 1.11 GB
Tue Dec 17, 2013 12:42 pm by titquarra

» NewBlueFx TotalFX Windows-FL | 1.11 GB
Tue Dec 17, 2013 12:42 pm by titquarra

» Celebrity.Sex.Tape.UNCUT.&.UNRATED.2012.720p.BRrip.x264.YIFY.mp4
Tue Dec 17, 2013 8:32 am by titquarra

» Maya Autodesk Personal Learning Edition 8.5
Tue Dec 17, 2013 7:47 am by titquarra

» Tuyệt Kỹ Đong Giai Chân Kinh (tuyệt Kỹ cua trai)
Thu Aug 23, 2012 5:38 am by Admin

» Tuyệt kỹ cua giai
Thu Aug 23, 2012 5:36 am by Admin

» NETCAT.........
Mon Aug 13, 2012 6:35 am by Admin

» Bảo mật CSDL bằng phương pháp mã hóa.
Tue Apr 17, 2012 10:04 pm by Admin

» Hàm mã hóa MD5 bằng JavaScript
Tue Apr 17, 2012 10:03 pm by Admin

Shopmotion


Affiliates
free forum


Thuật toán QuickSort

View previous topic View next topic Go down

Thuật toán QuickSort

Post  Admin on Thu Jun 09, 2011 2:53 am

#include<iostream.h>
using namespace std;
void QuickSort(int a***91;100***93;, int left, int right);
int main(){
int a***91;100***93;,N,i;
cout<<"N=";cin>>N;
for(i=0;i<N;i++){
cin>>a***91;i***93;;
}
QuickSort(a,0,N-1);
for(i=0;i<N;i++){
cout<<a***91;i***93;<<" ";
}
cout<<endl;
system("pause");
return 0;
}
void QuickSort(int a***91;100***93;, int left, int right){
int i, j, x;
i = left;
j = right;
x = a***91;(left + right)/2***93;;
do {
while (a***91;i***93; < x) i++;
while (a***91;j***93; > x) j--;
if (i <= j) {
int t= a***91;i***93;;
a***91;i***93; = a***91;j***93;;
a***91;j***93; = t;
i++;
j--;
}
}while (i < j);
if (i < right) QuickSort(a, i, right);
if (j > left) QuickSort(a, left, j);
}

Admin
Admin

Tổng số bài gửi : 782
Join date : 2009-08-15

View user profile http://hackis.forumotion.com

Back to top Go down

View previous topic View next topic Back to top

- Similar topics

 
Permissions in this forum:
You cannot reply to topics in this forum