merge: Fix GnomeSort algorithm and Add test case to it (#948)

Ankush263 · web-flow · commit 73efc89d2925 · 2022-03-24T21:50:39.000+05:30
diff --git a/Sorts/GnomeSort.js b/Sorts/GnomeSort.js
@@ -19,6 +19,7 @@ export function gnomeSort (items) {
       i = Math.max(1, i - 1)
     }
   }
+  return items
 }
 
 // Implementation of gnomeSort
diff --git a/Sorts/test/GnomeSort.test.js b/Sorts/test/GnomeSort.test.js
@@ -0,0 +1,19 @@
+import { gnomeSort } from '../GnomeSort'
+
+test('The gnomeSort of the array [5, 4, 3, 2, 1] is [1, 2, 3, 4, 5]', () => {
+  const arr = [5, 4, 3, 2, 1]
+  const res = gnomeSort(arr)
+  expect(res).toEqual([1, 2, 3, 4, 5])
+})
+
+test('The gnomeSort of the array [-5, 4, -3, 2, -1] is [-5, -3, -1, 2, 4]', () => {
+  const arr = [-5, 4, -3, 2, -1]
+  const res = gnomeSort(arr)
+  expect(res).toEqual([-5, -3, -1, 2, 4])
+})
+
+test('The gnomeSort of the array [15, 4, -13, 2, -11] is [-13, -11, 2, 4, 15]', () => {
+  const arr = [15, 4, -13, 2, -11]
+  const res = gnomeSort(arr)
+  expect(res).toEqual([-13, -11, 2, 4, 15])
+})

Original file line number	Diff line number	Diff line change
`@@ -19,6 +19,7 @@ export function gnomeSort (items) {`
`19`	`19`	`i = Math.max(1, i - 1)`
`20`	`20`	`}`
`21`	`21`	`}`
	`22`	`+ return items`
`22`	`23`	`}`
`23`	`24`
`24`	`25`	`// Implementation of gnomeSort`