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

style changes

Browse Source
This commit is contained in:
beqakd 2020-06-12 12:45:07 +04:00
parent 89c8a6277d
commit 0775bfc15e
1 changed files with 17 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

33
sorting/gnome_sort.cpp
View File

@ -4,15 +4,14 @@
* A basic implementation of gnome sort algorithm.
*/
#include <iostream> // for io operations
#include <iostream> // for io operations
/**
* Copyright 2020 @author beqakd
* @file
* A basic implementation of gnome sort algorithm.
* Gnome sort algorithm is not the best one. But it is used widely
* it looks two elements prev one and next one. If they are on
* it looks two elements prev one and next one. If they are on
* right order it forwards, otherwise it swaps elements.
* @param arr our array of elements.
* @param size size of given array
@ -21,19 +20,19 @@
* O(n^2)
* Some cases it works on O(n), but overall time is O(n^2)
*/
template <class T>
void gnomeSort(T arr[], int size) {
template <class T> void gnomeSort(T arr[], int size) {
// 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) {
// check for swap
if ((index == 0) || (arr[index] >= arr[index - 1])) {
index++;
if ((index == 0) || (arr[index] >= arr[index - 1])) {
index++;
} else {
std::swap(arr[index], arr[index - 1]); // swap
index--;
std::swap(arr[index], arr[index - 1]); // swap
index--;
}
}
}
@ -46,13 +45,15 @@ int main() {
int arr[] = {-22, 100, 150, 35, -10, 99};
int size = sizeof(arr) / sizeof(arr[0]);
gnomeSort(arr, size);
for (int i = 0; i < size; i++) std::printf("%d ", arr[i]);
std:: cout << "\n" << std:: endl;
for (int i = 0; i < size; i++)
std::printf("%d ", arr[i]);
std::cout << "\n" << std::endl;
// Example 2. Creating array of doubles.
double double_arr[6] = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2};
double double_arr[6] = {-100.2, 10.2, 20.0, 9.0, 7.5, 7.2};
size = sizeof(double_arr) / sizeof(double_arr[0]);
gnomeSort(double_arr, size);
for (int i = 0; i < size; i++) std::cout << double_arr[i] << " ";
for (int i = 0; i < size; i++)
std::cout << double_arr[i] << " ";
return 0;
}