-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathminmaxsorting.cpp
More file actions
63 lines (53 loc) · 1.59 KB
/
minmaxsorting.cpp
File metadata and controls
63 lines (53 loc) · 1.59 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
// min max sorting
// both way selection sorting
// 1. find max in D&C
// 2. Find min in D&C
// 3. swap with first and last items
#include<iostream>
using namespace std;
// Dand C min max not workig
int maximum_index(int arr[],int l,int r){
if (l>=r) return l;
int m=(l+r) / 2;
int u= maximum_index(arr,l,m);
int v= maximum_index(arr,m+1,r);
return (arr[u]> arr[v])? u: v;
}
int minimum_index(int arr[],int l,int r){
if (l>=r) return l;
int m=(l+r) / 2;
int u= minimum_index(arr,l,m);
int v= minimum_index(arr,m+1,r);
return (arr[u]< arr[v])? u: v;
}
void minmaxsorting(int arr[], int n){
for( int i=0,j=n-1;i<j;i++,j--){
cout << i << " " << j << endl;
int maxi= maximum_index(arr,i,j);
int mini= minimum_index(arr,i,j);
cout << "\n maximum " << arr[maxi] << " minimum "<< arr[mini] <<endl;
// int maxi=i, mini=i;
// int min =arr[mini],max=arr[maxi];
// for (int k = i; k <= j; k++) {
// if (arr[k] > max) {
// max = arr[k];
// maxi = k;
// } else if (arr[k] < min) {
// min = arr[k];
// mini = k;
// }
// }
swap(arr[i], arr[mini]); // put min at first position
if(arr[mini]>=arr[maxi])
swap(arr[j], arr[mini]); // shift max
else
swap(arr[j], arr[maxi]); // put max at last position
}
}
int main(){
int arr[]={20,4,15,6,17,8,9};
int n = sizeof(arr)/sizeof(arr[0]);
minmaxsorting(arr,n);
for(auto x :arr)
cout << x<< " ";
}