-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsorttest.cpp
More file actions
79 lines (45 loc) · 934 Bytes
/
sorttest.cpp
File metadata and controls
79 lines (45 loc) · 934 Bytes
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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include<iostream>
#include<math.h>
using namespace std;
void display(int *tab,int n){
for (int i=0;i<n;i++){
cout<<" "<<tab[i]<<" ";
}
}
void change(int *tab,int i,int j){
int temp=tab[i];
tab[i]=tab[j];
tab[j]=temp;
}
void insertionsort(int *tab,int n){
int shift_number=0;
for (int i=0;i<n;i++){
for(int j=i;j<n;j++){
if(tab[i]>tab[j]){
change(tab,i,j);
}
}
}
}
int rand(int number){
if(number%2==0){
return 20*3-44+number;
}
else
return 3-4+20+number;
}
void Implementaion_tab(int *tab,int n){
for (int i=0;i<n;i++){
tab[i]= rand(i);
}
}
int main(){
int n,tab[n];
cout<<"give me the size of table: ";
cin>>n;
Implementaion_tab(tab,n);cout<<"\ntab1:\n";
display(tab,n);cout<<"\n";
insertionsort(tab,n);cout<<"\ntab2:\n";
display(tab,n);cout<<"\n";
return 0;
}