-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbubble_mham_sort.cpp
103 lines (86 loc) · 2.05 KB
/
bubble_mham_sort.cpp
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
// #include <iostream>
// using namespace std;
// void bubbleSort(int arr[], int n)
// {
// for (int i = 0; i < n - 1; ++i)
// {
// for (int j = 0; j < n - i - 1; ++j)
// {
// if (arr[j] > arr[j + 1])
// {
// // Swap arr[j] and arr[j+1]
// int temp = arr[j];
// arr[j] = arr[j + 1];
// arr[j + 1] = temp;
// }
// }
// }
// }
// void printArray(int arr[], int n)
// {
// for (int i = 0; i < n; ++i)
// {
// cout << arr[i] << " ";
// }
// cout << endl;
// }
// int main()
// {
// int arr[] = {-2, 45, 0, 11, -9};
// int n = sizeof(arr) / sizeof(arr[0]);
// // cout << "NNNN is: " << n << endl;
// cout << "Original array: ";
// printArray(arr, n);
// bubbleSort(arr, n);
// cout << "Sorted array: ";
// printArray(arr, n);
// return 0;
// }
#include <iostream>
using namespace std;
void bubbleSort(int arr[], int n)
{
int count = 0;
int loop = 0;
for (int i = 0; i < n - 1; i++)
{
int swapped = 0;
for (int j = 0; j < n - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
count++;
swapped = 1;
}
}
if (swapped == 0)
{
break;
}
loop++;
}
cout << "The numbers of swapping: " << count << endl;
cout << "The numbers of loop running: " << loop << endl;
}
void printArray(int arr[], int n)
{
for (int i = 0; i < n; ++i)
{
cout << arr[i] << " ";
}
cout << endl;
}
int main()
{
int arr[] = {1, 2, 3, 5, 4, 6};
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Original array: ";
printArray(arr, n);
bubbleSort(arr, n);
cout << "Sorted array: ";
printArray(arr, n);
return 0;
}