OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

remove std and fixed style on clang-format

Browse Source
This commit is contained in:
beqakd 2020-06-05 18:43:31 +04:00
parent 8f4f8cdd7a
commit 12a8996049
1 changed files with 18 additions and 17 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

35
sorting/gnome_sort.cpp
View File

@ -1,29 +1,30 @@
#include <iostream> #include <iostream>
using namespace std;
void gnomesort(int arr[], int size) { void gnomesort(int arr[], int size) {
// few easy cases // few easy cases
if (size <= 1) return; if (size <= 1)
return;
int index = 0; // initialize some variables. int index = 0; // initialize some variables.
while (index < size) { while (index < size) {
// check for swap // check for swap
if ((index == 0) || (arr[index] >= arr[index - 1])) { if ((index == 0) || (arr[index] >= arr[index - 1])) {
index++; index++;
} else { } else {
swap(arr[index], arr[index - 1]); // swap std::swap(arr[index], arr[index - 1]); // swap
index--; index--;
}
} }
}
} }
// Our main function // Our main function
int main() { int main() {
int arr[] = {-2, -10, 100, 35, 34, 99}; int arr[] = {-2, -10, 100, 35, 34, 99};
int size = sizeof(arr) / sizeof(arr[0]); int size = sizeof(arr) / sizeof(arr[0]);
gnomesort(arr, size); gnomesort(arr, size);
for (int i = 0; i < size; i++) printf("%d ", arr[i]); for (int i = 0; i < size; i++)
printf("%d ", arr[i]);
return 0; return 0;
} }