From 18060ba1f41a9e678ec6dde7a371529163cab9df Mon Sep 17 00:00:00 2001 From: Ankitjethava Date: Sat, 28 Oct 2023 13:34:01 +0530 Subject: [PATCH 1/2] hi --- DSA/Arrays/BubbleSort.js | 2 +- JavaScriptONLY | 1 + 2 files changed, 2 insertions(+), 1 deletion(-) create mode 160000 JavaScriptONLY diff --git a/DSA/Arrays/BubbleSort.js b/DSA/Arrays/BubbleSort.js index c37a9d6..2edebd2 100644 --- a/DSA/Arrays/BubbleSort.js +++ b/DSA/Arrays/BubbleSort.js @@ -1,7 +1,7 @@ // Bubble sort Implementation using Javascript function bblSort(arr){ - + // it is not mandatory to initialize i with zero // loop through array for(var i = 0; i < arr.length; i++){ diff --git a/JavaScriptONLY b/JavaScriptONLY new file mode 160000 index 0000000..2b14da1 --- /dev/null +++ b/JavaScriptONLY @@ -0,0 +1 @@ +Subproject commit 2b14da18217aa76f16c28ff782e13b48539d9f93 From 83f1f8c3448831eabb207e385389d9ca1e43a34e Mon Sep 17 00:00:00 2001 From: Ankitjethava Date: Sat, 28 Oct 2023 13:43:45 +0530 Subject: [PATCH 2/2] new pdation in radix sort --- DSA/Arrays/RadixSort.js | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/DSA/Arrays/RadixSort.js b/DSA/Arrays/RadixSort.js index e4f1b5b..7b2853b 100644 --- a/DSA/Arrays/RadixSort.js +++ b/DSA/Arrays/RadixSort.js @@ -6,7 +6,7 @@ const countingSort = (arr, size, place) => { let freq = new Array(max + 1).fill(0); - + // this is one of my updation for (let i = 0; i < size; i++){ const num = Math.floor(arr[i] / place) % 10; freq[num]++;