From 36cfd7118c23dd1421adee4a9e15fb16521329bc Mon Sep 17 00:00:00 2001
From: beqakd <bgoga16@freeuni.edu.ge>
Date: Mon, 8 Jun 2020 10:22:45 +0400
Subject: [PATCH] style changes

---
 sorting/GnomeSort.cpp  | 29 -----------------------------
 sorting/gnome_sort.cpp | 35 +++++++++++++++++------------------
 2 files changed, 17 insertions(+), 47 deletions(-)
 delete mode 100644 sorting/GnomeSort.cpp

diff --git a/sorting/GnomeSort.cpp b/sorting/GnomeSort.cpp
deleted file mode 100644
index c225c6277..000000000
--- a/sorting/GnomeSort.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-#include <iostream>
-using namespace std;
-
-void GnomeSort(int arr[], int size) {
-    // few easy cases
-    if (size <= 1) return;
-
-    int index = 0;  // initialize some variables.
-    while (index < size) {
-        // check for swap
-        if ((index == 0) || (arr[index] >= arr[index - 1])) {
-            index++;
-        } else {
-            swap(arr[index], arr[index - 1]);  // swap
-            index--;
-        }
-    }
-}
-// Our main function
-int main() {
-    int arr[] = {-2, -10, 100, 35, 34, 99};
-    int size = sizeof(arr) / sizeof(arr[0]);
-
-    GnomeSort(arr, size);
-
-    for (int i = 0; i < size; i++) printf("%d ", arr[i]);
-
-    return 0;
-}
diff --git a/sorting/gnome_sort.cpp b/sorting/gnome_sort.cpp
index 885cbd36b..6bcf934cd 100644
--- a/sorting/gnome_sort.cpp
+++ b/sorting/gnome_sort.cpp
@@ -1,30 +1,29 @@
 #include <iostream>
 
 void gnomesort(int arr[], int size) {
-  // few easy cases
-  if (size <= 1)
-    return;
+    // few easy cases
+    if (size <= 1) return;
 
-  int index = 0; // initialize some variables.
-  while (index < size) {
-    // check for swap
-    if ((index == 0) || (arr[index] >= arr[index - 1])) {
-      index++;
-    } else {
-      std::swap(arr[index], arr[index - 1]); // swap
-      index--;
+    int index = 0;  // initialize some variables.
+    while (index < size) {
+        // check for swap
+        if ((index == 0) || (arr[index] >= arr[index - 1])) {
+            index++;
+        } else {
+            std::swap(arr[index], arr[index - 1]);  // swap
+            index--;
+        }
     }
-  }
 }
+
 // Our main function
 int main() {
-  int arr[] = {-2, -10, 100, 35, 34, 99};
-  int size = sizeof(arr) / sizeof(arr[0]);
+    int arr[] = {-22, 100, 150, 35, -10, 99};
+    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;
 }