added searching and sorting programs

Author: thatsabhishek

README.md

@@ -56,6 +56,17 @@ This repo includes:
     - [Pair Sum](./milestone2/arrays/PairSum.cpp)
     - [Triplet Sum](./milestone2/arrays/TripletSum.cpp)
     - [Sort 0 1](./milestone2/arrays/Sort01.cpp)
+  - [Searching and Sorting](./milestone2/SearchingandSorting/)
+    - [Code Binary Search](./milestone2/SearchingandSorting/CodeBinarySearch.cpp)
+    - [Code Bubble Sort](./milestone2/SearchingandSorting/CodeBubbleSort.cpp)
+    - [Code Insertion Sort](./milestone2/SearchingandSorting/CodeInsertionSort.cpp)
+    - [Code Merge Two Sorted Arrays](./milestone2/SearchingandSorting/CodeMergeTwoSortedArrays.cpp)
+    - [Push Zeros to end](./milestone2/SearchingandSorting/PushZerostoend.cpp)
+    - [Rotate array](./milestone2/SearchingandSorting/Rotatearray.cpp)
+    - [Second Largest in array](./milestone2/SearchingandSorting/SecondLargestinarray.cpp)
+    - [Check Array Rotation](./milestone2/SearchingandSorting/CheckArrayRotation.cpp)
+    - [Sort 0 1 2](./milestone2/SearchingandSorting/Sort012.cpp)
+    - [Sum of Two Arrays](./milestone2/SearchingandSorting/SumofTwoArrays.cpp)
 
 # Coding Ninjas
 ## Rate my Repo ⭐!!!

milestone2/SearchingandSorting/CheckArrayRotation.cpp

@@ -0,0 +1,61 @@
+You have been given an integer array/list(ARR) of size N. It has been sorted(in increasing order) and then rotated by some number 'K' (K is greater than 0) in the right hand direction.
+Your task is to write a function that returns the value of 'K', that means, the index from which the array/list has been rotated.
+Sample Input 1:
+1
+6
+5 6 1 2 3 4
+Sample Output 1:
+2
+
+// My Code:
+int arrayRotateCheck(int arr[], int n) {
+
+    int count=1;
+    bool check = false;
+    for(int i = 0; i < n-1; i++){
+        if(arr[i] <= arr[i+1]){
+            count++;
+        }
+        else{
+            check = true;
+            break;
+        }
+    }
+    if(check == false){
+        return 0;
+    }
+    else{
+        return count;
+    }
+}
+
+
+// Main Code:
+#include <iostream>
+using namespace std;
+
+#include "solution.h"
+
+int main()
+{
+
+	int t;
+	cin >> t;
+	while (t--)
+	{
+
+		int size;
+		cin >> size;
+		int *input = new int[size];
+
+		for (int i = 0; i < size; i++)
+		{
+			cin >> input[i];
+		}
+
+		cout << arrayRotateCheck(input, size) << endl;
+		delete[] input;
+	}
+	
+	return 0;
+}

milestone2/SearchingandSorting/CodeBinarySearch.cpp

@@ -0,0 +1,80 @@
+// You are given an integer array 'A' of size 'N', sorted in ascending order. You are also given an integer 'target'.
+// Your task is to write a function to search for 'target' in the array 'A'. If it exists, return its index in 0-based indexing. Otherwise, return -1.
+
+// Note: You must write an algorithm whose time complexity is O(logN).
+
+// Example:
+// Input: ‘N’ = 7 ‘target’ = 3
+// ‘A’ = [1, 3, 7, 9, 11, 12, 45]
+
+// Output: 1
+
+// Explanation: For A = [1, 3, 7, 9, 11, 12, 45],
+// The index of element '3' is 1.
+// Hence, the answer is '1'.
+
+// My Code:
+int search(vector<int>& nums, int target) {
+    int start = 0;
+    int end = nums.size()-1;
+
+    while (start <= end){
+        int mid = (start+end)/2;
+        if (nums[mid] == target)
+            return mid;
+        else if(target < nums[mid])
+            end = mid-1;
+        else
+            start = mid+1;
+    }
+    return -1;
+}
+
+// Main Code:
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = long long;
+#include "solution.h"
+
+
+class Runner
+{
+    int t = 1;
+    
+    vector<int> v;
+    int x;
+    
+public:
+    void takeInput()
+    {
+        int n; cin >> n;
+        assert(1 <= n && n <= (int)1e4);
+        v.assign(n, 0);
+        for(int i = 0; i < n; ++i) cin >> v[i];
+        cin >> x;
+    }
+    void execute()
+    {
+        vector<int> copy = v;
+        search(copy, x);
+    }
+
+    void executeAndPrintOutput()
+    {
+        vector<int> copy = v;
+        int ans = search(copy, x);
+        cout << ans << '\n';
+    }
+};
+
+int main()
+{
+    // freopen("./Testcases/large/in/input11.txt", "r", stdin);
+    // freopen("./Testcases/large/out/output11.txt", "w", stdout);
+    Runner runner;
+    runner.takeInput();
+    runner.executeAndPrintOutput();
+
+    return 0;
+}

milestone2/SearchingandSorting/CodeBubbleSort.cpp

@@ -0,0 +1,49 @@
+// Provided with a random integer array/list(ARR) of size N, you must sort this array using 'Bubble Sort'.
+// Note:
+// Change in the input array/list itself. You don't need to return or print the elements.
+
+// Example:
+// Input: ‘N’ = 7
+// 'ARR' = [2, 13, 4, 1, 3, 6, 28]
+// Output: [1 2 3 4 6 13 28]
+// Explanation: After applying 'bubble sort' on the input array, the output is [1 2 3 4 6 13 28].
+
+// My Code:
+void bubbleSort(int arr[], int n){
+    int k=0;
+    while( k < n-1){    // for n-1 round to sort the array
+        for(int i=0;i<n-1;i++){    // for 1 round
+            if(arr[i]>arr[i+1]){
+                int temp = arr[i];
+                arr[i] = arr[i+1];
+                arr[i+1] = temp;
+            }
+        }
+    k++;
+  }
+}
+
+// Main Code:
+#include<iostream>
+using namespace std;
+
+#include"solution.h"
+
+int main()
+{
+    int n;
+    cin>>n;
+    int arr[n];
+    for(int i=0;i<n;i++)
+    {
+        cin>>arr[i];
+    }
+    int target;
+    cin>>target;
+    bubbleSort(arr, n);
+	for(int i=0;i<n;i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+    return 0;
+}

milestone2/SearchingandSorting/CodeInsertionSort.cpp

@@ -0,0 +1,63 @@
+// Provided with a random integer array/list(ARR) of size N, you have been required to sort this array using 'Insertion Sort'.
+// Note:
+// Change in the input array/list itself. You don't need to return or print the elements.
+
+// Sample Input 1:
+// 1
+// 7
+// 2 13 4 1 3 6 28
+// Sample Output 1:
+// 1 2 3 4 6 13 28
+
+// My Code:
+void insertionSort(int arr[], int n){
+	// Write your code here
+    for(int i=1;i<n;i++){
+        int current=arr[i];
+        int j;
+        for( j = i-1; j >= 0;j--){
+            if(current < arr[j]){
+                arr[j+1]=arr[j];    // shifting by 1 position
+            }
+            else{
+                break;
+            }
+        }
+        arr[j+1]=current;
+    }
+}
+
+// Main Code:
+#include <iostream>
+using namespace std;
+
+#include "solution.h"
+
+int main()
+{
+	int t;
+	cin >> t;
+	
+	while (t--)
+	{
+		int size;
+		cin >> size;
+		int input[size];
+
+		for (int i = 0; i < size; i++)
+		{
+			cin >> input[i];
+		}
+
+		insertionSort(input, size);
+
+		for (int i = 0; i < size; i++)
+		{
+			cout << input[i] << " ";
+		}
+
+		cout << endl;
+	}
+
+	return 0;
+}

milestone2/SearchingandSorting/CodeMergeTwoSortedArrays.cpp

@@ -0,0 +1,77 @@
+// You have been given two sorted arrays/lists(ARR1 and ARR2) of size N and M respectively, merge them into a third array/list such that the third array is also sorted.
+
+// Note: Consider the case when size of the two arrays is not same.
+// Sample Input 1 :
+// 1
+// 5
+// 1 3 4 7 11
+// 4
+// 2 4 6 13
+// Sample Output 1 :
+// 1 2 3 4 4 6 7 11 13 
+
+// My Code:
+void merge(int arr1[], int size1, int arr2[], int size2, int ans[]){
+    int i = 0, j = 0, k = 0;
+    while(i < size1 && j < size2){ 
+        if(arr1[i] < arr2[j]){ 
+            ans[k++] = arr1[i++]; 
+        }
+        else{
+            ans[k++] = arr2[j++]; 
+        }
+    }
+    while(i < size1){ 
+        ans[k++] = arr1[i++];
+    }
+    while(j < size2){ 
+        ans[k++] = arr2[j++]; 
+    }
+}
+
+// Main Code:
+#include <iostream>
+using namespace std;
+
+#include "solution.h"
+
+int main()
+{
+	int t;
+	cin >> t;
+	
+	while (t--)
+	{
+		int size1;
+		cin >> size1;
+
+		int arr1[size1];
+
+		for (int i = 0; i < size1; i++)
+		{
+			cin >> arr1[i];
+		}
+
+		int size2;
+		cin >> size2;
+
+		int arr2[size2];
+
+		for (int i = 0; i < size2; i++)
+		{
+			cin >> arr2[i];
+		}
+
+		int ans[size1+size2];
+
+		merge(arr1, size1, arr2, size2, ans);
+
+		for (int i = 0; i < size1 + size2; i++)
+		{
+			cout << ans[i] << " ";
+		}
+
+		cout << endl;
+
+	}
+}