Merge branch 'master' into master

Author: SanjayDevTech

.github/workflows/greet-contributors.yml

@@ -0,0 +1,15 @@
+name: "GreetContributor"
+on:
+  pull_request_target:
+    types: [opened,synchronize]
+    
+jobs:
+  GreetCommitter: 
+    runs-on: ubuntu-latest
+    steps:
+    - name: "Contributors!!!"
+      uses: ibakshay/greet-contributors-action@v3
+      env: 
+        GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
+      with: 
+        content: "Thank you for taking your time and effort for your contribution. If you are a new contributor to this repo, kindly add your username in [CONTRIBUTORS.md](https://github.com/SanjayDevTech/Code-with-love/blob/master/CONTRIBUTORS.md)"

.gitignore

@@ -0,0 +1,8 @@
+# C or CPP
+*.exe
+
+# Python
+__pycache__/
+
+# java or kotlin
+*.class

Binary Search/saiharsha-22_inorder_program.java

@@ -0,0 +1,75 @@
+
+/*when you are compiling your program change the .java class file to inorder because the class declared as public*/
+
+import java.io.*;
+import java.util.*;
+ public class inorder{
+ 
+   private Node root;
+   private class Node{
+      
+     private Node left;
+     private Node right;
+     int data;
+      public Node(int data){
+        this.data=data;
+        System.out.print(data+"\t");
+     }
+  }
+
+ public void createBinaryTree(){
+       
+       Node first = new Node(1);
+       Node second = new Node(2);
+       Node third = new Node(3);
+       Node fourth = new Node(4);
+       Node fifth = new Node(5);
+
+        root = first;
+        first.left = second;
+        first.right = third;
+        second.left = fourth;
+        second.right = fifth;
+     }
+
+ /* public void inorders(Node root){
+
+         if(root == null){
+        return ; 
+        }
+       inorders(root.left);
+       System.out.print(root.data+"\t");
+       inorders(root.right);
+   } */
+
+/* this is using the stack concept*/
+
+  public void inorders(){
+
+  if(root == null){
+    return; 
+  }
+ Stack<Node> stack = new Stack<>();
+  Node temp = root;
+  while(!stack.isEmpty() || (temp!=null)){
+     if(temp!=null){
+      stack.push(temp);
+      temp = temp.left;
+      }else{
+        temp = stack.pop();
+        System.out.print(temp.data+"\t");
+        temp = temp.right;
+      }
+   }  
+}
+
+ public static void main(String args[]){
+
+   inorder obj = new inorder();
+   System.out.println("Before inorder");
+   obj.createBinaryTree();
+   System.out.println(); 
+   System.out.println("After inorder");
+   obj.inorders();
+  }
+}

CONTRIBUTORS.md

@@ -2,7 +2,6 @@
 
 If you have contributed to this repository, kindly add your username here
 
-
 - [SanjayDevtech](https://github.com/SanjayDevTech)
 - [hritikkhurana10sm](https://github.com/hritikkhurana10sm)
 - [finalight](https://github.com/finalight)
@@ -12,3 +11,16 @@ If you have contributed to this repository, kindly add your username here
 - [Mon Pacleb](https://github.com/bananaKetchup)
 - [lucifer79gg](https://github.com/lucifer79gg)
 - [sejalshri](https://github.com/sejalshri)
+- [afaditya](https://github.com/afaditya)
+- [aaishikasb](https://github.com/aaishikasb)
+- [sam0hack](https://github.com/sam0hack)
+- [shivajipotnuru](https://github.com/shivajipotnuru)
+- [albysabu9](https://github.com/albysabu9)
+- [Jayant-saksham](https://github.com/Jayant-saksham)
+- [Harshit564](https://github.com/Harshit564)
+- [sahil9001](https://github.com/sahil9001)
+- [southpole01](https://github.com/southpole01)
+- [HarshitGupta150](https://github.com/HarshitGupta150)
+- [qwertymaden](https://github.com/qwertymaden)
+- [mjnorton](https://github.com/mjnorton)
+- [gauravkhatri2698](https://github.com/gauravkhatri2698)

Linear Search/vikhyatsingh123_linear_search.c

@@ -0,0 +1,22 @@
+// Linear Search in C
+
+#include <stdio.h>
+
+int search(int array[], int n, int x) {
+  
+  // Going through array sequencially
+  for (int i = 0; i < n; i++)
+    if (array[i] == x)
+      return i;
+  return -1;
+}
+
+int main() {
+  int array[] = {2, 4, 0, 1, 9};
+  int x = 1;
+  int n = sizeof(array) / sizeof(array[0]);
+
+  int result = search(array, n, x);
+
+  (result == -1) ? printf("Element not found") : printf("Element found at index: %d", result);
+}

Linear Search/vikhyatsingh123_linear_search.cpp

@@ -0,0 +1,23 @@
+// Linear Search in C++
+
+#include <iostream>
+using namespace std;
+
+int search(int array[], int n, int x) {
+
+  // Going through array sequencially
+  for (int i = 0; i < n; i++)
+    if (array[i] == x)
+      return i;
+  return -1;
+}
+
+int main() {
+  int array[] = {2, 4, 0, 1, 9};
+  int x = 1;
+  int n = sizeof(array) / sizeof(array[0]);
+
+  int result = search(array, n, x);
+
+  (result == -1) ? cout << "Element not found" : cout << "Element found at index: " << result;
+}

README.md

@@ -1,27 +1,28 @@
 # Code-with-love
-Open source programming algorithms
-
+<p>
+  
+<img src="https://1.bp.blogspot.com/-_0LKyBpwg_o/X3ZLZwpbYwI/AAAAAAAAFxc/RCMlNoMN_0cMyZ06p2aFSgyMXHLtZ4WPgCLcBGAsYHQ/s1200/Newsletter%2BFacebook%2BHeader%2B%25282%2529.jpg">
+  </p>
 
 ## Instructions:
 
-*Make sure you have a GitHub account. In case you don't have one, you can create your account by visiting https://github.com/ and clicking on ``Sign up`` option at the top right corner.*
-
+_Make sure you have a GitHub account. In case you don't have one, you can create your account by visiting https://github.com/ and clicking on `Sign up` option at the top right corner._
 
 ### 1. Star and Fork this Repository
+
 ###### You can star and fork this repository on GitHub by navigating at the top of this repository.
 
 GitHub repository URLs will reference both the username associated with the owner of the repository, as well as the repository name. For example, acmbvp is the owner of the Hacktoberfest repository, so the GitHub URL for this project is:
 
 https://github.com/SanjayDevTech/Code-with-love
 
-
 When you’re on the main page of a repository, you’ll see a button to "Star" and “Fork” the repository on the upper right-hand side of the page, underneath your user icon.
 
 ### 2. Clone the Repository
 
 To make your own local copy of the repository you would like to contribute to, let’s first open up a terminal window.
 
-We’ll use the `git clone`  command along with the URL that points to your fork of the repository.
+We’ll use the `git clone` command along with the URL that points to your fork of the repository.
 
 This URL will be similar to the URL above, except now it will end with `.git.` The URL will look like this:
 https://github.com/your-username/Code-with-love.git
@@ -32,60 +33,65 @@ Once we have the URL, we’re ready to clone the repository. To do this, we’ll
 
 `git clone https://github.com/your-username/Code-with-love.git`
 
-
 ### 3. Create a New Branch
 
 To create your branch, from your terminal window, change your directory so that you are working in the directory of the repository. Be sure to use the actual name of the repository (i.e. Code-with-love) to switch into that directory.
 
-#####    `cd Code-with-love`
+##### `cd Code-with-love`
 
 Now, we’ll create our new branch with the git branch command. Make sure you name it descriptively so that others working on the project understand what you are working on.
 
 ##### `git branch new-branch`
 
 Now that our new branch is created, we can switch to make sure that we are working on that branch by using the git checkout command:
 
-##### ` git checkout new-branch `
+##### `git checkout new-branch`
 
 Once you enter the git `checkout` command, you will receive the following output:
 
-######  `Output:`
-#####  `Switched to branch 'new-branch' `
+###### `Output:`
+
+##### `Switched to branch 'new-branch' `
 
+##### `code .`
+
+Once you enter this command, the whole code will automatically open in your code editor
 
 At this point, you can now modify existing files or add new files to the project on your own branch.
 
 #### Make Changes Locally
 
 Once you have modified existing files or added new files to the project, you can add them to your local repository, which you can do with the git add command. Let’s add the -A flag to add all changes that we have made:
 
-##### ` git add -A ` or ` git add . `
+##### `git add -A` or `git add .`
 
 Next, we’ll want to record the changes that we made to the repository with the git commit command.
 
-*The commit message is an important aspect of your code contribution; it helps the other contributors fully understand the change you have made, why you made it, and how significant it is. Additionally, commit messages provide a historical record of the changes for the project at large, helping future contributors along the way.*
-
+_The commit message is an important aspect of your code contribution; it helps the other contributors fully understand the change you have made, why you made it, and how significant it is. Additionally, commit messages provide a historical record of the changes for the project at large, helping future contributors along the way._
 
 If you have a very short message, you can record that with the -m flag and the message in quotes:
 
-###### ` Example: `
-##### ` git commit -m "Updated Readme.md" `
+###### `Example:`
+
+##### `git commit -m "Updated Readme.md"`
 
 ###### At this point you can use the git push command to push the changes to the current branch of your forked repository:
+
 ###### ` Example:`
-##### ` git push --set-upstream origin new-branch `
+
+##### `git push --set-upstream origin new-branch`
 
 ### 4. Update Local Repository
 
-*While working on a project alongside other contributors, it is important for you to keep your local repository up-to-date with the project as you don’t want to make a pull request for code that will cause conflicts. To keep your local copy of the code base updated, you’ll need to sync changes.*
+_While working on a project alongside other contributors, it is important for you to keep your local repository up-to-date with the project as you don’t want to make a pull request for code that will cause conflicts. To keep your local copy of the code base updated, you’ll need to sync changes._
 
 We’ll first go over configuring a remote for the fork, then syncing the fork.
 
 ### 5. Configure a Remote for the Fork
 
 Next up, you’ll have to specify a new remote upstream repository for us to sync with the fork. This will be the original repository that you forked from. you’ll have to do this with the git remote add command.
 
-##### ` git remote add upstream https://github.com/your-username/Code-with-love.git `
+##### `git remote add upstream https://github.com/your-username/Code-with-love.git`
 
 In this example, // upstream // is the shortname we have supplied for the remote repository since in terms of Git, “upstream” refers to the repository that you cloned from. If you want to add a remote pointer to the repository of a collaborator, you may want to provide that collaborator’s username or a shortened nickname for the shortname.
 
@@ -94,15 +100,15 @@ In this example, // upstream // is the shortname we have supplied for the remote
 Once you have configured a remote that references the upstream and original repository on GitHub, you are ready to sync your fork of the repository to keep it up-to-date.
 To sync your fork, from the directory of your local repository in a terminal window, you’ll have to use the // git fetch // command to fetch the branches along with their respective commits from the upstream repository. Since you used the shortname “upstream” to refer to the upstream repository, you’ll have to pass that to the command:
 
-##### ` git fetch upstream `
+##### `git fetch upstream`
 
 Switch to the local master branch of our repository:
 
-##### ` git checkout master `
+##### `git checkout master`
 
 Now merge any changes that were made in the original repository’s master branch, that you will access through your local upstream/master branch, with your local master branch:
 
-##### ` git merge upstream/master `
+##### `git merge upstream/master`
 
 ### 7. Create Pull Request
 

c/Jayant_saksham_bubble_sort.cpp

@@ -0,0 +1,30 @@
+#include <stdio.h>
+int main()
+{
+    int n, A[100], swap;
+    printf("Enter the number of elements : ");
+    scanf("%d", &n);
+    printf("Now enter the array elements : ");
+    for(int i=0;i<n;i++)     
+    scanf("%d", &A[i]);
+    for(int i=0;i<(n-1);i++){                 //This line is for number of rounds (the result of first pass is the largest element get sorted)
+        for(int j=0;j<(n-i-1);j++){           //This line is for compairing the two adjecent numbers
+            if(A[j]>A[j+1]){
+                swap=A[j];
+                A[j]=A[j+1];
+                A[j+1]=swap;
+            }
+        }
+    }
+    printf("The sort array using Bubble sort is ");
+    for(int i=0;i<n;i++){
+        printf("%d ", A[i]);
+    }
+}
+
+//the concept is ek ek karke maximum number element will get sort
+ // f(n)=O(n2)
+ // no's on comparisions for n element array = 1+2+3+4+5+.....(n-1)
+ // no of swaps = 1+2+3+4+.....(n-1) 
+ // the analogy is bubble in water when stone is thrown in water
+ 

c/Jayant_saksham_count_sort.c

@@ -0,0 +1,57 @@
+#include<stdio.h>
+#include<stdlib.h>
+int findMax(int A[], int n){
+    int i,max;
+    max=A[0];
+    for(i=1;i<n;i++){
+        if(A[i]>max){
+            max=A[i];
+        }
+    }
+    return max;
+}
+void countSort(int A[], int n){
+    int max,i,j;
+    int *count;
+    max=findMax(A,n);  
+    count=(int *)malloc(sizeof(int));  
+    for(i=0;i<(max+1);i++){
+        count[i]=0;
+    }
+    for(i=0;i<n;i++){
+        count[A[i]]++;
+    }
+    i=0,j=0;
+    while(i<(max+1)){
+        if(count[i]>0){
+            A[j]=i;
+            j++;
+            count[i]--;
+        }
+        else
+        {
+            i++;
+        }   
+    }
+}
+
+int main(){
+    int n,i,A[10];
+    printf("Enter n");
+    scanf("%d",&n);
+    printf("Enter array element");
+    for(i=0;i<n;i++){
+        scanf("%d",&A[i]);
+    }
+    int max;
+    countSort(A,n);
+    printf("After sorting\n");
+    for(i=0;i<n;i++){
+        printf("%d ",A[i]);
+    }
+}
+
+// it is a space consuming algorithm
+// in count sort we take a array with size of maximum element present in initial array
+// in count array, number of occurence will be stored 
+// f(n)=O(n)