Jizzax filiali mustaqil ish

Misol:
#include
using namespace std;
int main() {
int n;
cin>>n;
int a[n];
for (int i = 0; i < n; i++)
cin>>a[i];
for (int i = n-1; i >= 1; i--) {
for (int j = 0; j < i; j++) {
if (a[j] > a[j+1]) {
int t = a[j];
a[j] = a[j+1];
a[j+1] = t;
}
}
}
for (int i = 0; i < n; i++)
cout<
return 0;
}

• 
  Ishlash vatqi ( ).
  
• 
  Taqqoshlashlar soni ( ).
  
• 
  Almashtirishlar soni ( ).
  
• 
  Qo’shimcha xotira .
  

Birlashtirish orqali saralash(Merge Sort) algoritmi.
Bu algoritm Jon fon Neyman tamonidan 1946 yilda taklif qilingan.
Jon Fon Neyman Vengriyalik matematika, kvant fizikasi, funksional
analiz, to’plamlar nazariyasi, ekonomika, informatika kabi fanlarga
munosib hissa qo’shgan.
Algoritmi:

min



5

8

15

29

32

7

18

20

25


8

15

29

32

7

18

20

25

5

5

7

5

5

25

20

18

7

32

29

15

8



8

7

5

5

25

20

18

7

32

29

15

8

7

5

5

25

20

18

7

32

29

15

8


18

15

8

7

5

5

25

20

18

7

32

29

15

8

15

8

7

5

5

25

20

18

7

32

29

15

8



25

20

18

15

8

7

5

5

25

20

18

7

32

29

15

8

20

18

15

8

7

5

5

25

20

18

7

32

29

15

8


8

15

29

32

7

18

20

25

5

5

7

8

15

18

20

25

29

32

25

20

18

15

8

7

5

5

25

20

18

7

32

29

15

8

29


m

R

L