From b2447d86ea2efba4dfdb688c2452f2216de6d31a Mon Sep 17 00:00:00 2001 From: nilesh-05 Date: Wed, 30 Sep 2020 23:55:14 +0530 Subject: [PATCH 1/4] Added CocktailSort.js --- JavaScript/CocktailSort.js | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 JavaScript/CocktailSort.js diff --git a/JavaScript/CocktailSort.js b/JavaScript/CocktailSort.js new file mode 100644 index 0000000..2160e1d --- /dev/null +++ b/JavaScript/CocktailSort.js @@ -0,0 +1,33 @@ +const cocktailSort = (arrInput) => { + let startIndex = 0, endIndex = arrInput.length, isSwapped = true; + while (isSwapped) { + isSwapped = false; + for (let i = startIndex; i < endIndex - 1; i++) { + if (arrInput[i] > arrInput[i + 1]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i + 1]; + arrInput[i + 1] = temp; + isSwapped = true; + } + } + endIndex--; + if (!isSwapped) { + break; + } + isSwapped = false; + for (let i = endIndex - 1; i > startIndex; i--) { + if (arrInput[i - 1] > arrInput[i]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i - 1]; + arrInput[i - 1] = temp; + isSwapped = true; + } + } + startIndex++; + } + return arrInput; +} +//Cocktail Sort is a variatio of bubble sort. +//Example Usage : +// let myArr = [8, 6, -4, 1, 84, 35] +// console.log(cocktailSort(myArr)) \ No newline at end of file From 7c15777717b11530f81782e3b0c94671a3150206 Mon Sep 17 00:00:00 2001 From: Nilesh Sharma <55238678+nilesh-05@users.noreply.github.com> Date: Sat, 3 Oct 2020 00:33:50 +0530 Subject: [PATCH 2/4] Updated tab spacing --- JavaScript/CocktailSort.js | 52 ++++++++++++++++++-------------------- 1 file changed, 25 insertions(+), 27 deletions(-) diff --git a/JavaScript/CocktailSort.js b/JavaScript/CocktailSort.js index 2160e1d..80d3321 100644 --- a/JavaScript/CocktailSort.js +++ b/JavaScript/CocktailSort.js @@ -1,33 +1,31 @@ const cocktailSort = (arrInput) => { - let startIndex = 0, endIndex = arrInput.length, isSwapped = true; - while (isSwapped) { - isSwapped = false; - for (let i = startIndex; i < endIndex - 1; i++) { - if (arrInput[i] > arrInput[i + 1]) { - let temp = arrInput[i]; - arrInput[i] = arrInput[i + 1]; - arrInput[i + 1] = temp; - isSwapped = true; - } - } - endIndex--; - if (!isSwapped) { - break; - } - isSwapped = false; - for (let i = endIndex - 1; i > startIndex; i--) { - if (arrInput[i - 1] > arrInput[i]) { - let temp = arrInput[i]; - arrInput[i] = arrInput[i - 1]; - arrInput[i - 1] = temp; - isSwapped = true; - } - } - startIndex++; +let startIndex = 0, endIndex = arrInput.length, isSwapped = true; +while (isSwapped) { + isSwapped = false; + for (let i = startIndex; i < endIndex - 1; i++) { + if (arrInput[i] > arrInput[i + 1]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i + 1]; + arrInput[i + 1] = temp; + isSwapped = true; + } + } + endIndex--; + if (!isSwapped) break; + isSwapped = false; + for (let i = endIndex - 1; i > startIndex; i--) { + if (arrInput[i - 1] > arrInput[i]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i - 1]; + arrInput[i - 1] = temp; + isSwapped = true; } - return arrInput; + } + startIndex++; +} +return arrInput; } //Cocktail Sort is a variatio of bubble sort. //Example Usage : // let myArr = [8, 6, -4, 1, 84, 35] -// console.log(cocktailSort(myArr)) \ No newline at end of file +// console.log(cocktailSort(myArr)) From 6ae836d3865d7ffcd47b501114d5c5940047302e Mon Sep 17 00:00:00 2001 From: Nilesh Sharma <55238678+nilesh-05@users.noreply.github.com> Date: Sat, 3 Oct 2020 13:49:26 +0530 Subject: [PATCH 3/4] Indent to 4 spaces --- JavaScript/CocktailSort.js | 48 +++++++++++++++++++------------------- 1 file changed, 24 insertions(+), 24 deletions(-) diff --git a/JavaScript/CocktailSort.js b/JavaScript/CocktailSort.js index 80d3321..db3eaf5 100644 --- a/JavaScript/CocktailSort.js +++ b/JavaScript/CocktailSort.js @@ -1,29 +1,29 @@ const cocktailSort = (arrInput) => { -let startIndex = 0, endIndex = arrInput.length, isSwapped = true; -while (isSwapped) { - isSwapped = false; - for (let i = startIndex; i < endIndex - 1; i++) { - if (arrInput[i] > arrInput[i + 1]) { - let temp = arrInput[i]; - arrInput[i] = arrInput[i + 1]; - arrInput[i + 1] = temp; - isSwapped = true; - } - } - endIndex--; - if (!isSwapped) break; - isSwapped = false; - for (let i = endIndex - 1; i > startIndex; i--) { - if (arrInput[i - 1] > arrInput[i]) { - let temp = arrInput[i]; - arrInput[i] = arrInput[i - 1]; - arrInput[i - 1] = temp; - isSwapped = true; + let startIndex = 0, endIndex = arrInput.length, isSwapped = true; + while (isSwapped) { + isSwapped = false; + for (let i = startIndex; i < endIndex - 1; i++) { + if (arrInput[i] > arrInput[i + 1]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i + 1]; + arrInput[i + 1] = temp; + isSwapped = true; + } + } + endIndex--; + if (!isSwapped) break; + isSwapped = false; + for (let i = endIndex - 1; i > startIndex; i--) { + if (arrInput[i - 1] > arrInput[i]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i - 1]; + arrInput[i - 1] = temp; + isSwapped = true; + } + } + startIndex++; } - } - startIndex++; -} -return arrInput; + return arrInput; } //Cocktail Sort is a variatio of bubble sort. //Example Usage : From 08da6f19d9661a693d9bca72e5ccc85919f3a723 Mon Sep 17 00:00:00 2001 From: Nilesh Sharma <55238678+nilesh-05@users.noreply.github.com> Date: Sat, 3 Oct 2020 13:50:32 +0530 Subject: [PATCH 4/4] Spaces to 4. --- JavaScript/CocktailSort.js | 22 +++++++++++----------- 1 file changed, 11 insertions(+), 11 deletions(-) diff --git a/JavaScript/CocktailSort.js b/JavaScript/CocktailSort.js index db3eaf5..6307eeb 100644 --- a/JavaScript/CocktailSort.js +++ b/JavaScript/CocktailSort.js @@ -3,23 +3,23 @@ const cocktailSort = (arrInput) => { while (isSwapped) { isSwapped = false; for (let i = startIndex; i < endIndex - 1; i++) { - if (arrInput[i] > arrInput[i + 1]) { - let temp = arrInput[i]; - arrInput[i] = arrInput[i + 1]; - arrInput[i + 1] = temp; - isSwapped = true; + if (arrInput[i] > arrInput[i + 1]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i + 1]; + arrInput[i + 1] = temp; + isSwapped = true; } } endIndex--; if (!isSwapped) break; isSwapped = false; for (let i = endIndex - 1; i > startIndex; i--) { - if (arrInput[i - 1] > arrInput[i]) { - let temp = arrInput[i]; - arrInput[i] = arrInput[i - 1]; - arrInput[i - 1] = temp; - isSwapped = true; - } + if (arrInput[i - 1] > arrInput[i]) { + let temp = arrInput[i]; + arrInput[i] = arrInput[i - 1]; + arrInput[i - 1] = temp; + isSwapped = true; + } } startIndex++; }