From 7f043ef1caefb25e28fd2d3279c56903584037a5 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:08:58 +0530 Subject: [PATCH 01/31] Create Merge_Sort.py --- .../Merge Sort/Merge_Sort.py | 70 +++++++++++++++++++ 1 file changed, 70 insertions(+) create mode 100644 Algorithms/Sorting_Algorithms/Merge Sort/Merge_Sort.py diff --git a/Algorithms/Sorting_Algorithms/Merge Sort/Merge_Sort.py b/Algorithms/Sorting_Algorithms/Merge Sort/Merge_Sort.py new file mode 100644 index 0000000..1afecd1 --- /dev/null +++ b/Algorithms/Sorting_Algorithms/Merge Sort/Merge_Sort.py @@ -0,0 +1,70 @@ +def merge(arr, l, m, r): + n1 = m - l + 1 + n2 = r- m + + # create temp arrays + L = [0] * (n1) + R = [0] * (n2) + + # Copy data to temp arrays L[] and R[] + for i in range(0 , n1): + L[i] = arr[l + i] + + for j in range(0 , n2): + R[j] = arr[m + 1 + j] + + # Merge the temp arrays back into arr[l..r] + i = 0 # Initial index of first subarray + j = 0 # Initial index of second subarray + k = l # Initial index of merged subarray + + while i < n1 and j < n2 : + if L[i] <= R[j]: + arr[k] = L[i] + i += 1 + else: + arr[k] = R[j] + j += 1 + k += 1 + + # Copy the remaining elements of L[], if there + # are any + while i < n1: + arr[k] = L[i] + i += 1 + k += 1 + + # Copy the remaining elements of R[], if there + # are any + while j < n2: + arr[k] = R[j] + j += 1 + k += 1 + +# l is for left index and r is right index of the +# sub-array of arr to be sorted +def mergeSort(arr,l,r): + if l < r: + + # Same as (l+r)//2, but avoids overflow for + # large l and h + m = (l+(r-1))//2 + + # Sort first and second halves + mergeSort(arr, l, m) + mergeSort(arr, m+1, r) + merge(arr, l, m, r) + + +# Driver code to test above +arr = [] +arr = [int(item) for item in input().split()] +n = len(arr) +print ("Given array is") +for i in range(n): + print ("%d" %arr[i]), + +mergeSort(arr,0,n-1) +print ("\n\nSorted array is") +for i in range(n): + print ("%d" %arr[i]), From 29b83bf45eb22d028397c4a0573a261166eb533f Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:11:31 +0530 Subject: [PATCH 02/31] Rename euclidean algorithm.c to euclidean_algorithm.c --- .../C/{euclidean algorithm.c => euclidean_algorithm.c} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/General_Algorithms/Euclidean_Algorithm/C/{euclidean algorithm.c => euclidean_algorithm.c} (100%) diff --git a/Algorithms/General_Algorithms/Euclidean_Algorithm/C/euclidean algorithm.c b/Algorithms/General_Algorithms/Euclidean_Algorithm/C/euclidean_algorithm.c similarity index 100% rename from Algorithms/General_Algorithms/Euclidean_Algorithm/C/euclidean algorithm.c rename to Algorithms/General_Algorithms/Euclidean_Algorithm/C/euclidean_algorithm.c From 27982858a713bcf13f1102e0735a0d24aa903d52 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:12:40 +0530 Subject: [PATCH 03/31] Rename maximum_pairwise_sum.py to MaxPairProduct.py --- .../{maximum_pairwise_sum.py => MaxPairProduct.py} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/General_Algorithms/Maximum Pairwise/{maximum_pairwise_sum.py => MaxPairProduct.py} (100%) diff --git a/Algorithms/General_Algorithms/Maximum Pairwise/maximum_pairwise_sum.py b/Algorithms/General_Algorithms/Maximum Pairwise/MaxPairProduct.py similarity index 100% rename from Algorithms/General_Algorithms/Maximum Pairwise/maximum_pairwise_sum.py rename to Algorithms/General_Algorithms/Maximum Pairwise/MaxPairProduct.py From c3feb77b2bc4f3254547fb27fe2b4427979be29e Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:12:55 +0530 Subject: [PATCH 04/31] Rename maximum_parwise.ipynb to MaxPairProduct.ipynb --- .../{maximum_parwise.ipynb => MaxPairProduct.ipynb} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/General_Algorithms/Maximum Pairwise/{maximum_parwise.ipynb => MaxPairProduct.ipynb} (100%) diff --git a/Algorithms/General_Algorithms/Maximum Pairwise/maximum_parwise.ipynb b/Algorithms/General_Algorithms/Maximum Pairwise/MaxPairProduct.ipynb similarity index 100% rename from Algorithms/General_Algorithms/Maximum Pairwise/maximum_parwise.ipynb rename to Algorithms/General_Algorithms/Maximum Pairwise/MaxPairProduct.ipynb From d4ffb3286a2cea2b8cf19c978427310381b1fa9d Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:13:40 +0530 Subject: [PATCH 05/31] Rename minimum_elements_with_difference_one_or_zero.ipynb to Minimum_elements_with_difference_one_or_zero.ipynb --- ...ipynb => Minimum_elements_with_difference_one_or_zero.ipynb} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename Algorithms/General_Algorithms/Minimum Subarray/{minimum_elements_with_difference_one_or_zero.ipynb => Minimum_elements_with_difference_one_or_zero.ipynb} (99%) diff --git a/Algorithms/General_Algorithms/Minimum Subarray/minimum_elements_with_difference_one_or_zero.ipynb b/Algorithms/General_Algorithms/Minimum Subarray/Minimum_elements_with_difference_one_or_zero.ipynb similarity index 99% rename from Algorithms/General_Algorithms/Minimum Subarray/minimum_elements_with_difference_one_or_zero.ipynb rename to Algorithms/General_Algorithms/Minimum Subarray/Minimum_elements_with_difference_one_or_zero.ipynb index 83f9fe2..2b91f8a 100644 --- a/Algorithms/General_Algorithms/Minimum Subarray/minimum_elements_with_difference_one_or_zero.ipynb +++ b/Algorithms/General_Algorithms/Minimum Subarray/Minimum_elements_with_difference_one_or_zero.ipynb @@ -54,4 +54,4 @@ ] } ] -} \ No newline at end of file +} From 7a569f05b2a6aa1932943d7eee3993c5c4fe8173 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:14:19 +0530 Subject: [PATCH 06/31] Rename DamianArado.c to Seive of Eratosthenes.c --- .../{DamianArado.c => Seive of Eratosthenes.c} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/General_Algorithms/SieveOfEratosthenes/{DamianArado.c => Seive of Eratosthenes.c} (100%) diff --git a/Algorithms/General_Algorithms/SieveOfEratosthenes/DamianArado.c b/Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes.c similarity index 100% rename from Algorithms/General_Algorithms/SieveOfEratosthenes/DamianArado.c rename to Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes.c From 8ce1fed1175bf1d7389bb5155b97571f38074b60 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:14:38 +0530 Subject: [PATCH 07/31] Rename Seive_of_erat...cpp to Seive of Eratosthenes.cpp --- .../{Seive_of_erat...cpp => Seive of Eratosthenes.cpp} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/General_Algorithms/SieveOfEratosthenes/{Seive_of_erat...cpp => Seive of Eratosthenes.cpp} (100%) diff --git a/Algorithms/General_Algorithms/SieveOfEratosthenes/Seive_of_erat...cpp b/Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes.cpp similarity index 100% rename from Algorithms/General_Algorithms/SieveOfEratosthenes/Seive_of_erat...cpp rename to Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes.cpp From 99e2a46249cca391346caef943600469a42c07a4 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:15:04 +0530 Subject: [PATCH 08/31] Rename Seive of Eratosthenes.c to Seive of Eratosthenes2.c --- .../SieveOfEratosthenes/{Shubh.c => Seive of Eratosthenes2.c} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename Algorithms/General_Algorithms/SieveOfEratosthenes/{Shubh.c => Seive of Eratosthenes2.c} (94%) diff --git a/Algorithms/General_Algorithms/SieveOfEratosthenes/Shubh.c b/Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes2.c similarity index 94% rename from Algorithms/General_Algorithms/SieveOfEratosthenes/Shubh.c rename to Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes2.c index cfb3737..140af0d 100644 --- a/Algorithms/General_Algorithms/SieveOfEratosthenes/Shubh.c +++ b/Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes2.c @@ -46,4 +46,4 @@ int main(void) -} \ No newline at end of file +} From 141770149011e66c46b0520d8e59cd35fda52700 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:15:24 +0530 Subject: [PATCH 09/31] Rename SieveOfEratosthenes.java to Seive of Eratosthenes.java --- .../{SieveOfEratosthenes.java => Seive of Eratosthenes.java} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/General_Algorithms/SieveOfEratosthenes/{SieveOfEratosthenes.java => Seive of Eratosthenes.java} (100%) diff --git a/Algorithms/General_Algorithms/SieveOfEratosthenes/SieveOfEratosthenes.java b/Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes.java similarity index 100% rename from Algorithms/General_Algorithms/SieveOfEratosthenes/SieveOfEratosthenes.java rename to Algorithms/General_Algorithms/SieveOfEratosthenes/Seive of Eratosthenes.java From 96f015eeb71349e9e818ce2e4ee700e4c737d98c Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:15:51 +0530 Subject: [PATCH 10/31] Delete .gitignore --- Algorithms/Greedy_Algorithms/.gitignore | 4 ---- 1 file changed, 4 deletions(-) delete mode 100644 Algorithms/Greedy_Algorithms/.gitignore diff --git a/Algorithms/Greedy_Algorithms/.gitignore b/Algorithms/Greedy_Algorithms/.gitignore deleted file mode 100644 index b37da0f..0000000 --- a/Algorithms/Greedy_Algorithms/.gitignore +++ /dev/null @@ -1,4 +0,0 @@ -__pycache__ -sum_from_array.ipynb -.mypy_cache -.ipynb_checkpoints From 3a85e92ed88e34e3fb0e7123731b35faee7467a6 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:16:33 +0530 Subject: [PATCH 11/31] Rename knapsack_problem_in_oops.py to knapsack_problem(Using Object Oriented Programming).py --- ...y => knapsack_problem(Using Object Oriented Programming).py} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename Algorithms/Greedy_Algorithms/{knapsack_problem_in_oops.py => knapsack_problem(Using Object Oriented Programming).py} (96%) diff --git a/Algorithms/Greedy_Algorithms/knapsack_problem_in_oops.py b/Algorithms/Greedy_Algorithms/knapsack_problem(Using Object Oriented Programming).py similarity index 96% rename from Algorithms/Greedy_Algorithms/knapsack_problem_in_oops.py rename to Algorithms/Greedy_Algorithms/knapsack_problem(Using Object Oriented Programming).py index aa61862..f20f9b6 100644 --- a/Algorithms/Greedy_Algorithms/knapsack_problem_in_oops.py +++ b/Algorithms/Greedy_Algorithms/knapsack_problem(Using Object Oriented Programming).py @@ -40,4 +40,4 @@ def get_max(weights,values): weights=[10,40,20,30] values=[60,40,100,120] max_value=final_value.get_max(weights,values) -print(max_value) \ No newline at end of file +print(max_value) From 3fa220233ae5e53d5185156ef4a8c367f5d62694 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:17:33 +0530 Subject: [PATCH 12/31] Rename BinarySearchMain.java to Binary Search.java --- .../Binary Search/{BinarySearchMain.java => Binary Search.java} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/Searching_Algorithms/Binary Search/{BinarySearchMain.java => Binary Search.java} (100%) diff --git a/Algorithms/Searching_Algorithms/Binary Search/BinarySearchMain.java b/Algorithms/Searching_Algorithms/Binary Search/Binary Search.java similarity index 100% rename from Algorithms/Searching_Algorithms/Binary Search/BinarySearchMain.java rename to Algorithms/Searching_Algorithms/Binary Search/Binary Search.java From c974845b1666017106615d5813c1b9c62ae4ada4 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:17:51 +0530 Subject: [PATCH 13/31] Rename PerfectSquare-BSearch.c to PerfectSquare-Binary Search.c --- .../{PerfectSquare-BSearch.c => PerfectSquare-Binary Search.c} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/Searching_Algorithms/Binary Search/{PerfectSquare-BSearch.c => PerfectSquare-Binary Search.c} (100%) diff --git a/Algorithms/Searching_Algorithms/Binary Search/PerfectSquare-BSearch.c b/Algorithms/Searching_Algorithms/Binary Search/PerfectSquare-Binary Search.c similarity index 100% rename from Algorithms/Searching_Algorithms/Binary Search/PerfectSquare-BSearch.c rename to Algorithms/Searching_Algorithms/Binary Search/PerfectSquare-Binary Search.c From eacd3a76f4c2b06632f93372357814573d3e359d Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:18:20 +0530 Subject: [PATCH 14/31] Rename perfect_square.ipynb to Perfect_square using Binary Search.ipynb --- ...ct_square.ipynb => Perfect_square using Binary Search.ipynb} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename Algorithms/Searching_Algorithms/Binary Search/{perfect_square.ipynb => Perfect_square using Binary Search.ipynb} (99%) diff --git a/Algorithms/Searching_Algorithms/Binary Search/perfect_square.ipynb b/Algorithms/Searching_Algorithms/Binary Search/Perfect_square using Binary Search.ipynb similarity index 99% rename from Algorithms/Searching_Algorithms/Binary Search/perfect_square.ipynb rename to Algorithms/Searching_Algorithms/Binary Search/Perfect_square using Binary Search.ipynb index ca57f4d..ef98109 100644 --- a/Algorithms/Searching_Algorithms/Binary Search/perfect_square.ipynb +++ b/Algorithms/Searching_Algorithms/Binary Search/Perfect_square using Binary Search.ipynb @@ -72,4 +72,4 @@ ] } ] -} \ No newline at end of file +} From 0cce02869ddccd4438ec5d68a1d17dbcef40da19 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:21:20 +0530 Subject: [PATCH 15/31] Create bubbleSort.py --- .../Bubble_Sort/bubbleSort.py | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 Algorithms/Sorting_Algorithms/Bubble_Sort/bubbleSort.py diff --git a/Algorithms/Sorting_Algorithms/Bubble_Sort/bubbleSort.py b/Algorithms/Sorting_Algorithms/Bubble_Sort/bubbleSort.py new file mode 100644 index 0000000..c79b9be --- /dev/null +++ b/Algorithms/Sorting_Algorithms/Bubble_Sort/bubbleSort.py @@ -0,0 +1,25 @@ +def bubbleSort(arr): + n = len(arr) + + # Traverse through all array elements + for i in range(n-1): + # range(n) also work but outer loop will repeat one time more than needed. + + # Last i elements are already in place + for j in range(0, n-i-1): + + # traverse the array from 0 to n-i-1 + # Swap if the element found is greater + # than the next element + if arr[j] > arr[j+1] : + arr[j], arr[j+1] = arr[j+1], arr[j] + +# Driver code to test above +arr = [] +arr = [int(item) for item in input().split()] + +bubbleSort(arr) + +print ("Sorted array is:") +for i in range(len(arr)): + print ("%d" %arr[i]) From 9c1b143e9622ea5d98f29560d897ba26151d0a8d Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:22:35 +0530 Subject: [PATCH 16/31] Create Radix Sort.cpp --- .../Radix Sort/Radix Sort.cpp | 74 +++++++++++++++++++ 1 file changed, 74 insertions(+) create mode 100644 Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp diff --git a/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp b/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp new file mode 100644 index 0000000..0b38f87 --- /dev/null +++ b/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp @@ -0,0 +1,74 @@ +// C++ implementation of Radix Sort +#include +using namespace std; + +// A utility function to get maximum value in arr[] +int getMax(int arr[], int n) +{ + int mx = arr[0]; + for (int i = 1; i < n; i++) + if (arr[i] > mx) + mx = arr[i]; + return mx; +} + +// A function to do counting sort of arr[] according to +// the digit represented by exp. +void countSort(int arr[], int n, int exp) +{ + int output[n]; // output array + int i, count[10] = { 0 }; + + // Store count of occurrences in count[] + for (i = 0; i < n; i++) + count[(arr[i] / exp) % 10]++; + + // Change count[i] so that count[i] now contains actual + // position of this digit in output[] + for (i = 1; i < 10; i++) + count[i] += count[i - 1]; + + // Build the output array + for (i = n - 1; i >= 0; i--) { + output[count[(arr[i] / exp) % 10] - 1] = arr[i]; + count[(arr[i] / exp) % 10]--; + } + + // Copy the output array to arr[], so that arr[] now + // contains sorted numbers according to current digit + for (i = 0; i < n; i++) + arr[i] = output[i]; +} + +// The main function to that sorts arr[] of size n using +// Radix Sort +void radixsort(int arr[], int n) +{ + // Find the maximum number to know number of digits + int m = getMax(arr, n); + + // Do counting sort for every digit. Note that instead + // of passing digit number, exp is passed. exp is 10^i + // where i is current digit number + for (int exp = 1; m / exp > 0; exp *= 10) + countSort(arr, n, exp); +} + +// A utility function to print an array +void print(int arr[], int n) +{ + for (int i = 0; i < n; i++) + cout << arr[i] << " "; +} + +// Driver Code +int main() +{ + int arr[] = { 170, 45, 75, 90, 802, 24, 2, 66 }; + int n = sizeof(arr) / sizeof(arr[0]); + + // Function Call + radixsort(arr, n); + print(arr, n); + return 0; +} From 88567a78a52a7a88e7808a4c9e32266c04bd797b Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:25:04 +0530 Subject: [PATCH 17/31] Update Radix Sort.cpp --- .../Sorting_Algorithms/Radix Sort/Radix Sort.cpp | 14 ++++++++------ 1 file changed, 8 insertions(+), 6 deletions(-) diff --git a/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp b/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp index 0b38f87..08e5a93 100644 --- a/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp +++ b/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.cpp @@ -60,15 +60,17 @@ void print(int arr[], int n) for (int i = 0; i < n; i++) cout << arr[i] << " "; } - -// Driver Code + int main() { - int arr[] = { 170, 45, 75, 90, 802, 24, 2, 66 }; - int n = sizeof(arr) / sizeof(arr[0]); + int arr[1000]; + for(int i=0;i<1000;i++){ + cin>>arr[i]; + } + int n = sizeof(arr) / sizeof(arr[0]); - // Function Call - radixsort(arr, n); + // Function Call + radixsort(arr, n); print(arr, n); return 0; } From ded98e171ce1515afe3d1dd81d40907cf0095e21 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:28:41 +0530 Subject: [PATCH 18/31] Create Radix Sort.java --- .../Radix Sort/Radix Sort.java | 92 +++++++++++++++++++ 1 file changed, 92 insertions(+) create mode 100644 Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.java diff --git a/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.java b/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.java new file mode 100644 index 0000000..7168d7e --- /dev/null +++ b/Algorithms/Sorting_Algorithms/Radix Sort/Radix Sort.java @@ -0,0 +1,92 @@ +// Radix sort Java implementation +import java.io.*; +import java.util.*; + +class Radix { + + // A utility function to get maximum value in arr[] + static int getMax(int arr[], int n) + { + int mx = arr[0]; + for (int i = 1; i < n; i++) + if (arr[i] > mx) + mx = arr[i]; + return mx; + } + + // A function to do counting sort of arr[] according to + // the digit represented by exp. + static void countSort(int arr[], int n, int exp) + { + int output[] = new int[n]; // output array + int i; + int count[] = new int[10]; + Arrays.fill(count, 0); + + // Store count of occurrences in count[] + for (i = 0; i < n; i++) + count[(arr[i] / exp) % 10]++; + + // Change count[i] so that count[i] now contains + // actual position of this digit in output[] + for (i = 1; i < 10; i++) + count[i] += count[i - 1]; + + // Build the output array + for (i = n - 1; i >= 0; i--) { + output[count[(arr[i] / exp) % 10] - 1] = arr[i]; + count[(arr[i] / exp) % 10]--; + } + + // Copy the output array to arr[], so that arr[] now + // contains sorted numbers according to curent digit + for (i = 0; i < n; i++) + arr[i] = output[i]; + } + + // The main function to that sorts arr[] of size n using + // Radix Sort + static void radixsort(int arr[], int n) + { + // Find the maximum number to know number of digits + int m = getMax(arr, n); + + // Do counting sort for every digit. Note that + // instead of passing digit number, exp is passed. + // exp is 10^i where i is current digit number + for (int exp = 1; m / exp > 0; exp *= 10) + countSort(arr, n, exp); + } + + // A utility function to print an array + static void print(int arr[], int n) + { + for (int i = 0; i < n; i++) + System.out.print(arr[i] + " "); + } + + /*Driver Code*/ + public static void main(String[] args) + { + Scanner s=new Scanner(System.in); + + System.out.println("enter number of elements: "); + int n=s.nextInt(); + + int arr[]=new int[n]; + + System.out.println("Enter array elements: "); + + for(int i=0;i Date: Wed, 7 Oct 2020 15:29:06 +0530 Subject: [PATCH 19/31] Rename QuickSortMain.java to QuickSort.java --- .../quick_sort/{QuickSortMain.java => QuickSort.java} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename Algorithms/Sorting_Algorithms/quick_sort/{QuickSortMain.java => QuickSort.java} (100%) diff --git a/Algorithms/Sorting_Algorithms/quick_sort/QuickSortMain.java b/Algorithms/Sorting_Algorithms/quick_sort/QuickSort.java similarity index 100% rename from Algorithms/Sorting_Algorithms/quick_sort/QuickSortMain.java rename to Algorithms/Sorting_Algorithms/quick_sort/QuickSort.java From 595f7f1440ccb388cf2e879943e588ac668ee653 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:29:27 +0530 Subject: [PATCH 20/31] Rename quick_sort_recursion.ipynb to quick_sort_using_recursion.ipynb --- ...ck_sort_recursion.ipynb => quick_sort_using_recursion.ipynb} | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) rename Algorithms/Sorting_Algorithms/quick_sort/{quick_sort_recursion.ipynb => quick_sort_using_recursion.ipynb} (99%) diff --git a/Algorithms/Sorting_Algorithms/quick_sort/quick_sort_recursion.ipynb b/Algorithms/Sorting_Algorithms/quick_sort/quick_sort_using_recursion.ipynb similarity index 99% rename from Algorithms/Sorting_Algorithms/quick_sort/quick_sort_recursion.ipynb rename to Algorithms/Sorting_Algorithms/quick_sort/quick_sort_using_recursion.ipynb index 48934a2..acdb647 100644 --- a/Algorithms/Sorting_Algorithms/quick_sort/quick_sort_recursion.ipynb +++ b/Algorithms/Sorting_Algorithms/quick_sort/quick_sort_using_recursion.ipynb @@ -58,4 +58,4 @@ ] } ] -} \ No newline at end of file +} From 3cd440074515cc31ec251df44834a8457833b5f7 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:32:11 +0530 Subject: [PATCH 21/31] Update README.md --- README.md | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index 73e5b73..a76df5b 100644 --- a/README.md +++ b/README.md @@ -8,24 +8,24 @@ The soul aim of this initiative is to bring together all the tech heads, who are This ๐‘ถ๐’๐’†๐‘ซ๐’‚๐’š๐‘ถ๐’๐’†๐‘จ๐’๐’ˆ๐’ is a series that we are conducting here on GitHub as a part of L-ByDo Community. You will have algorithms to solve each day, code it in whatever language you are comfortable with and upload your file here on https://github.com/L-ByDo/OneDayOneAlgo . -๐—–๐—ผ๐—ป๐˜๐—ฟ๐—ถ๐—ฏ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ด๐˜‚๐—ถ๐—ฑ๐—ฒ๐—น๐—ถ๐—ป๐—ฒ๐˜€:- +### ๐—–๐—ผ๐—ป๐˜๐—ฟ๐—ถ๐—ฏ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ด๐˜‚๐—ถ๐—ฑ๐—ฒ๐—น๐—ถ๐—ป๐—ฒ๐˜€ : 1.๐˜พ๐™ค๐™ข๐™ข๐™ช๐™ฃ๐™ž๐™˜๐™–๐™ฉ๐™ž๐™ฃ๐™œ ๐™š๐™›๐™›๐™š๐™˜๐™ฉ๐™ž๐™ซ๐™š๐™ก๐™ฎ: Whether youโ€™re a one-time contributor or trying to join a community, working with others is one of the most important skills youโ€™ll develop in open source. Before you open an issue or pull request, or ask a question in chat, keep these points in mind to help your ideas come across effectively. -(a).๐‘ฎ๐’Š๐’—๐’† ๐‘ช๐’๐’๐’•๐’†๐’™๐’• : Help others get quickly up to speed. If youโ€™re running into an error, explain what youโ€™re trying to do and how to reproduce it. If youโ€™re suggesting a new idea, explain why you think itโ€™d be useful to the project (not just to you!). + - ๐‘ฎ๐’Š๐’—๐’† ๐‘ช๐’๐’๐’•๐’†๐’™๐’• : Help others get quickly up to speed. If youโ€™re running into an error, explain what youโ€™re trying to do and how to reproduce it. If youโ€™re suggesting a new idea, explain why you think itโ€™d be useful to the project (not just to you!). -(b).๐‘ซ๐’ ๐’š๐’๐’–๐’“ ๐’‰๐’๐’Ž๐’†๐’˜๐’๐’“๐’Œ ๐’ƒ๐’†๐’‡๐’๐’“๐’†๐’‰๐’‚๐’๐’…: Itโ€™s OK not to know things, but show that you tried. Before asking for help, be sure to check a projectโ€™s README, documentation, issues (open or closed), mailing list, and search the internet for an answer. People will appreciate when you demonstrate that youโ€™re trying to learn. + - ๐‘ซ๐’ ๐’š๐’๐’–๐’“ ๐’‰๐’๐’Ž๐’†๐’˜๐’๐’“๐’Œ ๐’ƒ๐’†๐’‡๐’๐’“๐’†๐’‰๐’‚๐’๐’…: Itโ€™s OK not to know things, but show that you tried. Before asking for help, be sure to check a projectโ€™s README, documentation, issues (open or closed), mailing list, and search the internet for an answer. People will appreciate when you demonstrate that youโ€™re trying to learn. -(c).๐‘ฒ๐’†๐’†๐’‘ ๐’“๐’†๐’’๐’–๐’†๐’”๐’•๐’” ๐’”๐’‰๐’๐’“๐’• ๐’‚๐’๐’… ๐’…๐’Š๐’“๐’†๐’„๐’•: Much like sending an email, every contribution, no matter how simple or helpful, requires someone elseโ€™s review. Many projects have more incoming requests than people available to help. Be concise. You will increase the chance that someone will be able to help you. + - ๐‘ฒ๐’†๐’†๐’‘ ๐’“๐’†๐’’๐’–๐’†๐’”๐’•๐’” ๐’”๐’‰๐’๐’“๐’• ๐’‚๐’๐’… ๐’…๐’Š๐’“๐’†๐’„๐’•: Much like sending an email, every contribution, no matter how simple or helpful, requires someone elseโ€™s review. Many projects have more incoming requests than people available to help. Be concise. You will increase the chance that someone will be able to help you. -(d).๐‘ฒ๐’†๐’†๐’‘ ๐’‚๐’๐’ ๐’„๐’๐’Ž๐’Ž๐’–๐’๐’Š๐’„๐’‚๐’•๐’Š๐’๐’ ๐’‘๐’–๐’ƒ๐’๐’Š๐’„: Although itโ€™s tempting, donโ€™t reach out to maintainers privately unless you need to share sensitive information (such as a security issue or serious conduct violation). When you keep the conversation public, more people can learn and benefit from your exchange. Discussions can be, in themselves, contributions. + - ๐‘ฒ๐’†๐’†๐’‘ ๐’‚๐’๐’ ๐’„๐’๐’Ž๐’Ž๐’–๐’๐’Š๐’„๐’‚๐’•๐’Š๐’๐’ ๐’‘๐’–๐’ƒ๐’๐’Š๐’„: Although itโ€™s tempting, donโ€™t reach out to maintainers privately unless you need to share sensitive information (such as a security issue or serious conduct violation). When you keep the conversation public, more people can learn and benefit from your exchange. Discussions can be, in themselves, contributions. -(e).๐‘ฐ๐’•โ€™๐’” ๐’๐’Œ๐’‚๐’š ๐’•๐’ ๐’‚๐’”๐’Œ ๐’’๐’–๐’†๐’”๐’•๐’Š๐’๐’๐’” (๐’ƒ๐’–๐’• ๐’ƒ๐’† ๐’‘๐’‚๐’•๐’Š๐’†๐’๐’•!): Everybody was new to the project at some point, and even experienced contributors need to get up to speed when they look at a new project. By the same token, even longtime maintainers are not always familiar with every part of the project. Show them the same patience that youโ€™d want them to show to you. + - ๐‘ฐ๐’•โ€™๐’” ๐’๐’Œ๐’‚๐’š ๐’•๐’ ๐’‚๐’”๐’Œ ๐’’๐’–๐’†๐’”๐’•๐’Š๐’๐’๐’” (๐’ƒ๐’–๐’• ๐’ƒ๐’† ๐’‘๐’‚๐’•๐’Š๐’†๐’๐’•!): Everybody was new to the project at some point, and even experienced contributors need to get up to speed when they look at a new project. By the same token, even longtime maintainers are not always familiar with every part of the project. Show them the same patience that youโ€™d want them to show to you. -(f).๐‘น๐’†๐’”๐’‘๐’†๐’„๐’• ๐’„๐’๐’Ž๐’Ž๐’–๐’๐’Š๐’•๐’š ๐’…๐’†๐’„๐’Š๐’”๐’Š๐’๐’๐’”: Your ideas may differ from the communityโ€™s priorities or vision. They may offer feedback or decide not to pursue your idea. While you should discuss and look for compromise, maintainers have to live with your decision longer than you will. If you disagree with their direction, you can always work on your own fork or start your own project. + - ๐‘น๐’†๐’”๐’‘๐’†๐’„๐’• ๐’„๐’๐’Ž๐’Ž๐’–๐’๐’Š๐’•๐’š ๐’…๐’†๐’„๐’Š๐’”๐’Š๐’๐’๐’”: Your ideas may differ from the communityโ€™s priorities or vision. They may offer feedback or decide not to pursue your idea. While you should discuss and look for compromise, maintainers have to live with your decision longer than you will. If you disagree with their direction, you can always work on your own fork or start your own project. -(g).๐‘จ๐’ƒ๐’๐’—๐’† ๐’‚๐’๐’, ๐’Œ๐’†๐’†๐’‘ ๐’Š๐’• ๐’„๐’๐’‚๐’”๐’”๐’š: Open source is made up of collaborators from all over the world. Context gets lost across languages, cultures, geographies, and time zones. In addition, written communication makes it harder to convey a tone or mood. Assume good intentions in these conversations. Itโ€™s fine to politely push back on an idea, ask for more context, or further clarify your position. Just try to leave the internet a better place than when you found it. + - ๐‘จ๐’ƒ๐’๐’—๐’† ๐’‚๐’๐’, ๐’Œ๐’†๐’†๐’‘ ๐’Š๐’• ๐’„๐’๐’‚๐’”๐’”๐’š: Open source is made up of collaborators from all over the world. Context gets lost across languages, cultures, geographies, and time zones. In addition, written communication makes it harder to convey a tone or mood. Assume good intentions in these conversations. Itโ€™s fine to politely push back on an idea, ask for more context, or further clarify your position. Just try to leave the internet a better place than when you found it. 2.๐™‚๐™–๐™ฉ๐™๐™š๐™ง๐™ž๐™ฃ๐™œ ๐™˜๐™ค๐™ฃ๐™ฉ๐™š๐™ญ๐™ฉ: Before doing anything, do a quick check to make sure your idea hasnโ€™t been discussed elsewhere. Skim the projectโ€™s README, issues (open and closed), mailing list, and Stack Overflow. You donโ€™t have to spend hours going through everything, but a quick search for a few key terms goes a long way. If you canโ€™t find your idea elsewhere, youโ€™re ready to make a move. If the project is on GitHub, youโ€™ll likely communicate by opening an issue or pull request: From a760300cb280761692b2c43d9c8a4273e1861435 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:33:00 +0530 Subject: [PATCH 22/31] Update README.md --- README.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index a76df5b..0cd4df5 100644 --- a/README.md +++ b/README.md @@ -10,7 +10,8 @@ This ๐‘ถ๐’๐’†๐‘ซ๐’‚๐’š๐‘ถ๐’๐’†๐‘จ๐’๐’ˆ๐’ is a series that we ar ### ๐—–๐—ผ๐—ป๐˜๐—ฟ๐—ถ๐—ฏ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ด๐˜‚๐—ถ๐—ฑ๐—ฒ๐—น๐—ถ๐—ป๐—ฒ๐˜€ : -1.๐˜พ๐™ค๐™ข๐™ข๐™ช๐™ฃ๐™ž๐™˜๐™–๐™ฉ๐™ž๐™ฃ๐™œ ๐™š๐™›๐™›๐™š๐™˜๐™ฉ๐™ž๐™ซ๐™š๐™ก๐™ฎ: Whether youโ€™re a one-time contributor or trying to join a community, working with others is one of the most important skills youโ€™ll develop in open source. +#### 1.๐˜พ๐™ค๐™ข๐™ข๐™ช๐™ฃ๐™ž๐™˜๐™–๐™ฉ๐™ž๐™ฃ๐™œ ๐™š๐™›๐™›๐™š๐™˜๐™ฉ๐™ž๐™ซ๐™š๐™ก๐™ฎ: +Whether youโ€™re a one-time contributor or trying to join a community, working with others is one of the most important skills youโ€™ll develop in open source. Before you open an issue or pull request, or ask a question in chat, keep these points in mind to help your ideas come across effectively. - ๐‘ฎ๐’Š๐’—๐’† ๐‘ช๐’๐’๐’•๐’†๐’™๐’• : Help others get quickly up to speed. If youโ€™re running into an error, explain what youโ€™re trying to do and how to reproduce it. If youโ€™re suggesting a new idea, explain why you think itโ€™d be useful to the project (not just to you!). From b520253e4878385c16eff5411b407e45e5ae15ea Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:34:01 +0530 Subject: [PATCH 23/31] Update README.md --- README.md | 9 +++++---- 1 file changed, 5 insertions(+), 4 deletions(-) diff --git a/README.md b/README.md index 0cd4df5..057270f 100644 --- a/README.md +++ b/README.md @@ -28,11 +28,12 @@ Before you open an issue or pull request, or ask a question in chat, keep these - ๐‘จ๐’ƒ๐’๐’—๐’† ๐’‚๐’๐’, ๐’Œ๐’†๐’†๐’‘ ๐’Š๐’• ๐’„๐’๐’‚๐’”๐’”๐’š: Open source is made up of collaborators from all over the world. Context gets lost across languages, cultures, geographies, and time zones. In addition, written communication makes it harder to convey a tone or mood. Assume good intentions in these conversations. Itโ€™s fine to politely push back on an idea, ask for more context, or further clarify your position. Just try to leave the internet a better place than when you found it. -2.๐™‚๐™–๐™ฉ๐™๐™š๐™ง๐™ž๐™ฃ๐™œ ๐™˜๐™ค๐™ฃ๐™ฉ๐™š๐™ญ๐™ฉ: Before doing anything, do a quick check to make sure your idea hasnโ€™t been discussed elsewhere. Skim the projectโ€™s README, issues (open and closed), mailing list, and Stack Overflow. You donโ€™t have to spend hours going through everything, but a quick search for a few key terms goes a long way. -If you canโ€™t find your idea elsewhere, youโ€™re ready to make a move. If the project is on GitHub, youโ€™ll likely communicate by opening an issue or pull request: +#### 2.๐™‚๐™–๐™ฉ๐™๐™š๐™ง๐™ž๐™ฃ๐™œ ๐™˜๐™ค๐™ฃ๐™ฉ๐™š๐™ญ๐™ฉ: +Before doing anything, do a quick check to make sure your idea hasnโ€™t been discussed elsewhere. Skim the projectโ€™s README, issues (open and closed), mailing list, and Stack Overflow. You donโ€™t have to spend hours going through everything, but a quick search for a few key terms goes a long way. +If you canโ€™t find your idea elsewhere, youโ€™re ready to make a move. If the project is on GitHub, youโ€™ll likely communicate by opening an issue or pull request:
-(a).Issues are like starting a conversation or discussion -(b).Pull requests are for starting work on a solution + - Issues are like starting a conversation or discussion + - Pull requests are for starting work on a solution For lightweight communication, such as a clarifying or how-to question, try asking on Stack Overflow, IRC, Slack, or other chat channels, if the project has one Before you open an issue or pull request, check the projectโ€™s contributing docs (usually a file called CONTRIBUTING, or in the README), to see whether you need to include anything specific. For example, they may ask that you follow a template, or require that you use tests. From 51aba9b048c7bfe8396a345ae922f8b11aaddf3e Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:34:23 +0530 Subject: [PATCH 24/31] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 057270f..da380d5 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ ๐—ฐ๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† :- +# ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ ๐—ฐ๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† :- We have developed a community to promote Learning By Doing, no matter, what your branch is or from which college you belong.What you need here is a passion for your interests in learning and implementing technology related stuffs. We will act as facilitators while anyone joining this community acts as a volunteer.โœ… The soul aim of this initiative is to bring together all the tech heads, who are committed to enhance their knowledge,so as to promote collaborative learning and problem solving. We will be having virtual discussions on different topics of concern.Alongwith it ,we will be constantly sharing important information from various resources.๐Ÿ“š From 814e72248b4686f0fc27fa5460ad6954a1d52fe3 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:35:55 +0530 Subject: [PATCH 25/31] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index da380d5..d7a06f3 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ ๐—ฐ๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† :- +# ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ ๐—ฐ๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† : We have developed a community to promote Learning By Doing, no matter, what your branch is or from which college you belong.What you need here is a passion for your interests in learning and implementing technology related stuffs. We will act as facilitators while anyone joining this community acts as a volunteer.โœ… The soul aim of this initiative is to bring together all the tech heads, who are committed to enhance their knowledge,so as to promote collaborative learning and problem solving. We will be having virtual discussions on different topics of concern.Alongwith it ,we will be constantly sharing important information from various resources.๐Ÿ“š From 4c4eedb54852e516b1f5261ea33e25a8241b0243 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:37:03 +0530 Subject: [PATCH 26/31] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index d7a06f3..5d8e7e4 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,4 @@ -# ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ ๐—ฐ๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† : +# ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ C๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† : We have developed a community to promote Learning By Doing, no matter, what your branch is or from which college you belong.What you need here is a passion for your interests in learning and implementing technology related stuffs. We will act as facilitators while anyone joining this community acts as a volunteer.โœ… The soul aim of this initiative is to bring together all the tech heads, who are committed to enhance their knowledge,so as to promote collaborative learning and problem solving. We will be having virtual discussions on different topics of concern.Alongwith it ,we will be constantly sharing important information from various resources.๐Ÿ“š From b2f46c8269e1eec22ca4e84a3407dffca1edc493 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:43:25 +0530 Subject: [PATCH 27/31] Update README.md --- README.md | 30 +++++++++++++++++------------- 1 file changed, 17 insertions(+), 13 deletions(-) diff --git a/README.md b/README.md index 5d8e7e4..c5d50e7 100644 --- a/README.md +++ b/README.md @@ -1,4 +1,5 @@ # ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ C๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† : + We have developed a community to promote Learning By Doing, no matter, what your branch is or from which college you belong.What you need here is a passion for your interests in learning and implementing technology related stuffs. We will act as facilitators while anyone joining this community acts as a volunteer.โœ… The soul aim of this initiative is to bring together all the tech heads, who are committed to enhance their knowledge,so as to promote collaborative learning and problem solving. We will be having virtual discussions on different topics of concern.Alongwith it ,we will be constantly sharing important information from various resources.๐Ÿ“š @@ -8,9 +9,9 @@ The soul aim of this initiative is to bring together all the tech heads, who are This ๐‘ถ๐’๐’†๐‘ซ๐’‚๐’š๐‘ถ๐’๐’†๐‘จ๐’๐’ˆ๐’ is a series that we are conducting here on GitHub as a part of L-ByDo Community. You will have algorithms to solve each day, code it in whatever language you are comfortable with and upload your file here on https://github.com/L-ByDo/OneDayOneAlgo . -### ๐—–๐—ผ๐—ป๐˜๐—ฟ๐—ถ๐—ฏ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ด๐˜‚๐—ถ๐—ฑ๐—ฒ๐—น๐—ถ๐—ป๐—ฒ๐˜€ : +## ๐—–๐—ผ๐—ป๐˜๐—ฟ๐—ถ๐—ฏ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ด๐˜‚๐—ถ๐—ฑ๐—ฒ๐—น๐—ถ๐—ป๐—ฒ๐˜€ : -#### 1.๐˜พ๐™ค๐™ข๐™ข๐™ช๐™ฃ๐™ž๐™˜๐™–๐™ฉ๐™ž๐™ฃ๐™œ ๐™š๐™›๐™›๐™š๐™˜๐™ฉ๐™ž๐™ซ๐™š๐™ก๐™ฎ: +### 1.๐˜พ๐™ค๐™ข๐™ข๐™ช๐™ฃ๐™ž๐™˜๐™–๐™ฉ๐™ž๐™ฃ๐™œ ๐™š๐™›๐™›๐™š๐™˜๐™ฉ๐™ž๐™ซ๐™š๐™ก๐™ฎ: Whether youโ€™re a one-time contributor or trying to join a community, working with others is one of the most important skills youโ€™ll develop in open source. Before you open an issue or pull request, or ask a question in chat, keep these points in mind to help your ideas come across effectively. @@ -28,7 +29,7 @@ Before you open an issue or pull request, or ask a question in chat, keep these - ๐‘จ๐’ƒ๐’๐’—๐’† ๐’‚๐’๐’, ๐’Œ๐’†๐’†๐’‘ ๐’Š๐’• ๐’„๐’๐’‚๐’”๐’”๐’š: Open source is made up of collaborators from all over the world. Context gets lost across languages, cultures, geographies, and time zones. In addition, written communication makes it harder to convey a tone or mood. Assume good intentions in these conversations. Itโ€™s fine to politely push back on an idea, ask for more context, or further clarify your position. Just try to leave the internet a better place than when you found it. -#### 2.๐™‚๐™–๐™ฉ๐™๐™š๐™ง๐™ž๐™ฃ๐™œ ๐™˜๐™ค๐™ฃ๐™ฉ๐™š๐™ญ๐™ฉ: +### 2.๐™‚๐™–๐™ฉ๐™๐™š๐™ง๐™ž๐™ฃ๐™œ ๐™˜๐™ค๐™ฃ๐™ฉ๐™š๐™ญ๐™ฉ: Before doing anything, do a quick check to make sure your idea hasnโ€™t been discussed elsewhere. Skim the projectโ€™s README, issues (open and closed), mailing list, and Stack Overflow. You donโ€™t have to spend hours going through everything, but a quick search for a few key terms goes a long way. If you canโ€™t find your idea elsewhere, youโ€™re ready to make a move. If the project is on GitHub, youโ€™ll likely communicate by opening an issue or pull request:
@@ -39,19 +40,22 @@ For lightweight communication, such as a clarifying or how-to question, try aski Before you open an issue or pull request, check the projectโ€™s contributing docs (usually a file called CONTRIBUTING, or in the README), to see whether you need to include anything specific. For example, they may ask that you follow a template, or require that you use tests. If you want to make a substantial contribution, open an issue to ask before working on it. Itโ€™s helpful to watch the project for a while (on GitHub, you can click โ€œWatchโ€ to be notified of all conversations), and get to know community members, before doing work that might not get accepted. -3.๐™Š๐™ฅ๐™š๐™ฃ๐™ž๐™ฃ๐™œ ๐™–๐™ฃ ๐™ž๐™จ๐™จ๐™ช๐™š: You should usually open an issue in the following situations: +### 3.๐™Š๐™ฅ๐™š๐™ฃ๐™ž๐™ฃ๐™œ ๐™–๐™ฃ ๐™ž๐™จ๐™จ๐™ช๐™š: +You should usually open an issue in the following situations: -(a).Report an error you canโ€™t solve yourself -(b).Discuss a high-level topic or idea (for example, community, vision or policies) -(c).Propose a new feature or other project idea + - Report an error you canโ€™t solve yourself + - Discuss a high-level topic or idea (for example, community, vision or policies) + - Propose a new feature or other project idea Tips for communicating on issues: - -(a).If you see an open issue that you want to tackle, comment on the issue to let people know youโ€™re on it. That way, people are less likely to duplicate your work. -(b).If an issue was opened a while ago, itโ€™s possible that itโ€™s being addressed somewhere else, or has already been resolved, so comment to ask for confirmation before starting work. -(c).If you opened an issue, but figured out the answer later on your own, comment on the issue to let people know, then close the issue. Even documenting that outcome is a contribution to the project. - -4.๐™Š๐™ฅ๐™š๐™ฃ๐™ž๐™ฃ๐™œ ๐™– ๐™ฅ๐™ช๐™ก๐™ก ๐™ง๐™š๐™ฆ๐™ช๐™š๐™จ๐™ฉ: You should usually open a pull request in the following situations: +
    +
  1. If you see an open issue that you want to tackle, comment on the issue to let people know youโ€™re on it. That way, people are less likely to duplicate your work.
    2. +
  2. If an issue was opened a while ago, itโ€™s possible that itโ€™s being addressed somewhere else, or has already been resolved, so comment to ask for confirmation before starting work.
    3. +
  3. If you opened an issue, but figured out the answer later on your own, comment on the issue to let people know, then close the issue. Even documenting that outcome is a contribution to the project.
    4. +
+ +### 4.๐™Š๐™ฅ๐™š๐™ฃ๐™ž๐™ฃ๐™œ ๐™– ๐™ฅ๐™ช๐™ก๐™ก ๐™ง๐™š๐™ฆ๐™ช๐™š๐™จ๐™ฉ: +You should usually open a pull request in the following situations: (a).Submit trivial fixes (for example, a typo, a broken link or an obvious error) (b).Start work on a contribution that was already asked for, or that youโ€™ve already discussed, in an issue From d46de1d94a31632ae9314df5d8ac7eeb2960a4c4 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:45:37 +0530 Subject: [PATCH 28/31] Update README.md --- README.md | 22 +++++++++++----------- 1 file changed, 11 insertions(+), 11 deletions(-) diff --git a/README.md b/README.md index c5d50e7..aade81f 100644 --- a/README.md +++ b/README.md @@ -57,19 +57,19 @@ Tips for communicating on issues: ### 4.๐™Š๐™ฅ๐™š๐™ฃ๐™ž๐™ฃ๐™œ ๐™– ๐™ฅ๐™ช๐™ก๐™ก ๐™ง๐™š๐™ฆ๐™ช๐™š๐™จ๐™ฉ: You should usually open a pull request in the following situations: -(a).Submit trivial fixes (for example, a typo, a broken link or an obvious error) -(b).Start work on a contribution that was already asked for, or that youโ€™ve already discussed, in an issue -(c).A pull request doesnโ€™t have to represent finished work. Itโ€™s usually better to open a pull request early on, so others can watch or give feedback on your progress. Just mark it as a โ€œWIPโ€ (Work in Progress) in the subject line. You can always add more commits later. + - Submit trivial fixes (for example, a typo, a broken link or an obvious error) + - Start work on a contribution that was already asked for, or that youโ€™ve already discussed, in an issue + - A pull request doesnโ€™t have to represent finished work. Itโ€™s usually better to open a pull request early on, so others can watch or give feedback on your progress. Just mark it as a โ€œWIPโ€ (Work in Progress) in the subject line. You can always add more commits later. If the project is on GitHub, hereโ€™s how to submit a pull request: - -(a).Fork the repository and clone it locally. Connect your local to the original โ€œupstreamโ€ repository by adding it as a remote. Pull in changes from โ€œupstreamโ€ often so that you stay up to date so that when you submit your pull request, merge conflicts will be less likely. (See more detailed instructions here.) -(b).Create a branch for your edits. -(c).Reference any relevant issues or supporting documentation in your PR (for example, โ€œCloses #37.โ€) -(d).Include screenshots of the before and after if your changes include differences in HTML/CSS. Drag and drop the images into the body of your pull request. -(e).Test your changes! Run your changes against any existing tests if they exist and create new ones when needed. Whether tests exist or not, make sure your changes donโ€™t break the existing project. -(f).Contribute in the style of the project to the best of your abilities. This may mean using indents, semi-colons or comments differently than you would in your own repository, but makes it easier for the maintainer to merge, others to understand and maintain in the future. - +
    +
  1. Fork the repository and clone it locally. Connect your local to the original โ€œupstreamโ€ repository by adding it as a remote. Pull in changes from โ€œupstreamโ€ often so that you stay up to date so that when you submit your pull request, merge conflicts will be less likely. (See more detailed instructions here.)
    2. +
  2. Create a branch for your edits.
    3. +
  3. Reference any relevant issues or supporting documentation in your PR (for example, โ€œCloses #37.โ€)
    4. +
  4. Include screenshots of the before and after if your changes include differences in HTML/CSS. Drag and drop the images into the body of your pull request.
    5. +
  5. Test your changes! Run your changes against any existing tests if they exist and create new ones when needed. Whether tests exist or not, make sure your changes donโ€™t break the existing project.
    6. +
  6. Contribute in the style of the project to the best of your abilities. This may mean using indents, semi-colons or comments differently than you would in your own repository, but makes it easier for the maintainer to merge, others to understand and maintain in the future.
    7. +
๐’€๐’๐’– ๐’…๐’Š๐’… ๐’Š๐’• !! ๐Ÿ’ฏ Whether you just made your first open source contribution, or youโ€™re looking for new ways to contribute, we hope youโ€™re inspired to take action. From 4008bb99744316a54e3412419e2b807438ee757f Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:47:50 +0530 Subject: [PATCH 29/31] Update README.md --- README.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index aade81f..85b244b 100644 --- a/README.md +++ b/README.md @@ -69,8 +69,9 @@ If the project is on GitHub, hereโ€™s how to submit a pull request:
  • Include screenshots of the before and after if your changes include differences in HTML/CSS. Drag and drop the images into the body of your pull request.
  • Test your changes! Run your changes against any existing tests if they exist and create new ones when needed. Whether tests exist or not, make sure your changes donโ€™t break the existing project.
  • Contribute in the style of the project to the best of your abilities. This may mean using indents, semi-colons or comments differently than you would in your own repository, but makes it easier for the maintainer to merge, others to understand and maintain in the future.
    • - -๐’€๐’๐’– ๐’…๐’Š๐’… ๐’Š๐’• !! ๐Ÿ’ฏ +
    + + Whether you just made your first open source contribution, or youโ€™re looking for new ways to contribute, we hope youโ€™re inspired to take action. From 07ace81cf4ba79019a519ea52829eefbb8c047d0 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 15:55:08 +0530 Subject: [PATCH 30/31] Update README.md --- README.md | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 85b244b..0dcf7b5 100644 --- a/README.md +++ b/README.md @@ -70,7 +70,9 @@ If the project is on GitHub, hereโ€™s how to submit a pull request:
  • Test your changes! Run your changes against any existing tests if they exist and create new ones when needed. Whether tests exist or not, make sure your changes donโ€™t break the existing project.
  • Contribute in the style of the project to the best of your abilities. This may mean using indents, semi-colons or comments differently than you would in your own repository, but makes it easier for the maintainer to merge, others to understand and maintain in the future.

    • - + +

    You did it ๐Ÿ†

    + Whether you just made your first open source contribution, or youโ€™re looking for new ways to contribute, we hope youโ€™re inspired to take action. From 858531e076587a2c51a33f81b7d910f7d40c28e7 Mon Sep 17 00:00:00 2001 From: Toulik Das Date: Wed, 7 Oct 2020 16:01:09 +0530 Subject: [PATCH 31/31] Update README.md --- README.md | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/README.md b/README.md index 0dcf7b5..16352a9 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,7 @@ +

    + +

    + # ๐—”๐—ฏ๐—ผ๐˜‚๐˜ ๐—Ÿ-๐—•๐˜†๐——๐—ผ C๐—ผ๐—บ๐—บ๐˜‚๐—ป๐—ถ๐˜๐˜† : We have developed a community to promote Learning By Doing, no matter, what your branch is or from which college you belong.What you need here is a passion for your interests in learning and implementing technology related stuffs. @@ -6,7 +10,7 @@ The soul aim of this initiative is to bring together all the tech heads, who are -This ๐‘ถ๐’๐’†๐‘ซ๐’‚๐’š๐‘ถ๐’๐’†๐‘จ๐’๐’ˆ๐’ is a series that we are conducting here on GitHub as a part of L-ByDo Community. You will have algorithms to solve each day, code it in whatever language you are comfortable with and upload your file here on https://github.com/L-ByDo/OneDayOneAlgo . +This ๐‘ถ๐’๐’†๐‘ซ๐’‚๐’š๐‘ถ๐’๐’†๐‘จ๐’๐’ˆ๐’ is a series that we are conducting here on GitHub as a part of L-ByDo Community. You will have algorithms to solve each day, code it in whatever language you are comfortable with and upload your file [here](https://github.com/L-ByDo/OneDayOneAlgo). ## ๐—–๐—ผ๐—ป๐˜๐—ฟ๐—ถ๐—ฏ๐˜‚๐˜๐—ถ๐—ผ๐—ป ๐—ด๐˜‚๐—ถ๐—ฑ๐—ฒ๐—น๐—ถ๐—ป๐—ฒ๐˜€ :