Add sorting algorithms file

Author: mahiuddin-dev

BubbleShort.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+
+using namespace std;
+
+// Bubble Sort algorithm
+int BubbleShort(int a[], int n) {
+	int i, j, temp;
+	for (i = 0; i < n - 1; i++) {
+		for (j = 0; j < n - i - 1; j++) {
+			if (a[j] > a[j + 1]) {
+				temp = a[j];
+				a[j] = a[j + 1];
+				a[j + 1] = temp;
+			}
+		}
+	}
+    return -1;
+}
+
+
+int main(){
+    int arr[] = {64, 34, 25, 12, 22, 11, 90};
+    int n = sizeof(arr)/sizeof(arr[0]);
+    BubbleShort(arr, n);
+    cout << "Sorted array: \n";
+    for (int i=0; i<n; i++)
+        cout << arr[i] << " ";
+    return 0;
+}

InsertionSort.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+
+using namespace std;
+
+// Insertion Sort algorithm
+int InsertionSort(int *arr, int size){
+    int i, j, key;
+    for (i = 1; i < size; i++){
+        key = arr[i];
+        j = i - 1;
+        while (j >= 0 && arr[j] > key){
+            arr[j + 1] = arr[j];
+            j = j - 1;
+        }
+        arr[j + 1] = key;
+    }
+    return *arr;
+}
+
+
+int main(){
+    int arr[] = {64, 25, 12, 22, 11};
+    int size = sizeof(arr) / sizeof(arr[0]);
+    InsertionSort(arr, size);
+    cout << "Sorted array: ";
+    int i;
+    for (i = 0; i < size; i++)
+        cout << arr[i] << " ";
+    
+    return 0;
+}

MergeSort.cpp

@@ -0,0 +1,60 @@
+#include<iostream>
+#include<vector>
+#define MAX 100000
+using namespace std;
+
+//You are given two sorted arrays A and B. You want to merge these arrays and return a sorted vector will elements from both arrays.
+void merge(vector<int> &a, vector<int> &b, vector<int> &toreturn)
+{ 
+    int apointer = 0, bpointer = 0; //point to the first element in the vectors
+	
+    //That hasn't been taken yet
+    while(apointer<a.size() && bpointer<b.size())
+	{
+        if(a[apointer]<=b[bpointer]){
+            toreturn.push_back(a[apointer++]);
+        }
+        else{ //b[bpointer] < a[apointer]
+//            inv += (a.size() - apointer);
+            toreturn.push_back(b[bpointer++]);
+        }
+    }
+    while(apointer<a.size()) toreturn.push_back(a[apointer++]);
+    while(bpointer<b.size()) toreturn.push_back(b[bpointer++]);
+}
+
+void ms(int arr[], int s, int e){
+//	cout<<s<<" "<<e<<endl;
+	if(s==e){// there is only one or no element
+		return;
+	}
+	int mid = (s+e)/2;
+	ms(arr, s, mid);
+	ms(arr, mid+1, e);
+	
+	// Now arr[] has two sorted parts inside it. 
+	// We have to take them out, merge the two parts and 
+	// then resassign the values to arr[]
+	vector<int> a,b;
+	for(int i=s; i<=mid; i++) a.push_back(arr[i]);
+	for(int i=mid+1; i<=e; i++) b.push_back(arr[i]);  
+	
+	vector<int> temp;
+	merge(a,b, temp);
+	for(int i=0; i<temp.size(); i++)
+		arr[s+i] = temp[i];
+	
+}
+
+
+
+int main()
+{
+	int n; 
+	cin>>n; 
+	int arr[n];
+	for(int i=0; i<n; i++) cin>>arr[i];
+	ms(arr, 0, n-1);
+	for(int i=0; i<n; i++) cout<<arr[i]<<" ";
+	cout<<endl;
+}

SelectionSort.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+
+int main(){
+    
+    int n;
+    cout<<"Enter the size of array:";
+    cin>>n;
+    int arr[n];
+     cout<<"Enter the elements of array:";
+    for(int i=0;i<n;i++){
+        cin>>arr[i];
+     }
+    for(int i=0;i<n-1;i++){
+        for(int j=i+1;j<n;j++){
+            if(arr[j]<arr[i]){
+                int temp=arr[j];
+                arr[j]=arr[i];
+                arr[i]=temp;
+              }
+            }
+        }
+        for(int i=0;i<n;i++){
+            cout<<arr[i]<<" ";
+        }
+    cout<<endl;
+	return 0;
+}

contributor.md

@@ -79,5 +79,6 @@ Open Email Generator
 - [Alex](https://github.com/jokowhoiam)
 - [Faezal](https://github.com/Blazes05)
 - [Taufik](https://github.com/Taufikrhrp)
+- [Mahiuddin](https://github.com/mahiuddin-dev)
 
 <!-- prettier-ignore-end -->

quick_sort.cpp

@@ -0,0 +1,62 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+void swap(int* a, int* b)
+{
+	int t = *a;
+	*a = *b;
+	*b = t;
+}
+
+
+int partition (int arr[], int low, int top)
+{
+	int pivot = arr[top]; 
+	int i = (low - 1); 
+
+	for (int j = low; j <= top - 1; j++)
+	{
+	
+		if (arr[j] < pivot)
+		{
+			i++;
+			swap(&arr[i], &arr[j]);
+		}
+	}
+	swap(&arr[i + 1], &arr[top]);
+	return (i + 1);
+}
+
+
+void quickSort(int arr[], int low, int top)
+{
+	if (low < top)
+	{
+	
+		int pi = partition(arr, low, top);
+
+		
+		quickSort(arr, low, pi - 1);
+		quickSort(arr, pi + 1, top);
+	}
+}
+
+
+void printArray(int arr[], int size)
+{
+	int i;
+	for (i = 0; i < size; i++)
+		cout << arr[i] << " ";
+	cout << endl;
+}
+int main()
+{
+	int arr[] = {10, 7, 8, 9, 1, 5};
+	int n = sizeof(arr) / sizeof(arr[0]);
+	quickSort(arr, 0, n - 1);
+	cout << "Sorted array: \n";
+	printArray(arr, n);
+	return 0;
+}
+