saralash algoritmi (quick sort)

6-labatariya #include using namespace std; void swap(int *a, int *b){ int t = *a; *a=*b; *b = t; } int ajratish(int arr[], int low, int high){ int pivot = arr[high]; int i = (low-1); for (int j=low;j<=high-1;j++){ if (arr[j] < pivot){ i++; swap(&arr[i],&arr[j]); } } swap(&arr[i+1],&arr[high]); return (i+1); } void quick_saralash(int arr[], int low, int high){ if(low<high){ int p = ajratish (arr, low, high); quick_saralash(arr,low,p-1); quick_saralash(arr,p+1,high); } } void printarray(int arr[], int size){ int i; for(i=0;i<size;i++){ cout<<arr[i]<<" "; } cout<<endl; } int main() { int arr[]={15,1,9,6,-1,17}; int n = sizeof(arr)/sizeof(arr[0]); quick_saralash(arr,0,n-1); cout<<"saralangan massiv elementlari:\n"; printarray(arr,n); return 0; }

This file contains 2 pages in DOC format (31.0 KB). To download "saralash algoritmi (quick sort)", click the Telegram button on the left.