Add files via upload

Author: skjha1

Sorting Technique/01 Bubble Sort.c

@@ -0,0 +1,51 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+void swap(int* x, int* y) // function for swapping
+{
+	int temp = *x;
+	*x = *y;
+	*y = temp;
+}
+
+void Bubble(int A[], int n) // size of array // no of elements 
+{
+	int i, j, flag = 0; // flag is for adptive (Criteria)
+	for (i = 0; i < n - 1; i++)
+	{
+		flag = 0;
+		for (j = 0; j < n - i - 1; j++)
+		{
+			if (A[j] > A[j + 1])
+			{
+				swap(&A[j], &A[j + 1]); // if is greater then swap the elements 
+				flag = 1; 
+			}
+		}
+		if (flag == 0)
+			break;
+
+	}
+}
+int main()
+{
+	int A[20], i;
+	int n = sizeof(A) / sizeof(int);
+	scanf_s("%d", &n);
+	for (i = 0; i < n; i++)
+	{
+		scanf_s("%d", & A[i]);
+	}
+	
+	Bubble(A, n); //  callig the funtion 
+
+	for (i = 0; i < n; i++)
+		printf("%d ", A[i]);
+	printf("\n");
+
+	return 0;
+}
+
+// Bubble sort is Adptive: if the list is sorted it will use flag  // Bubble sort is stable  : in case of duplicate 
+// time complexity is : min = o(n) - in the case of Adaptivity 
+//					  : max = o(n2)

Sorting Technique/02 BubbleSort.cpp

@@ -0,0 +1,48 @@
+#include <iostream>
+
+using namespace std;
+ 
+template <class T>
+void Print(T& vec, int n, string s){
+    cout << s << ": [" << flush;
+    for (int i=0; i<n; i++){
+        cout << vec[i] << flush;
+        if (i < n-1){
+            cout << ", " << flush;
+        }
+    }
+    cout << "]" << endl;
+}
+ 
+void swap(int* x, int* y){
+    int temp = *x;
+    *x = *y;
+    *y = temp;
+}
+ 
+void BubbleSort(int A[], int n){
+    int flag = 0;
+    for (int i=0; i<n-1; i++){
+        for (int j=0; j<n-1-i; j++){
+            if (A[j] > A[j+1]){
+                swap(&A[j], &A[j+1]);
+                flag = 1;
+            }
+        }
+        if (flag == 0){
+            return;
+        }
+    }
+}
+ 
+int main() {
+ 
+    int A[] = {3, 7, 9, 10, 6, 5, 12, 4, 11, 2};
+    int n = sizeof(A)/sizeof(A[0]);
+    Print(A, n, "\t\tA");
+ 
+    BubbleSort(A, n);
+    Print(A, n, " Sorted A");
+ 
+    return 0;
+}

Sorting Technique/03 Insertionsort.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+void swap(int* a, int* b)
+{
+	int temp = *a;
+	*a = *b;
+	*b = temp;
+}
+void Insertionsort(int A[], int n)
+{
+	int i, j, x;
+	for (i = 1; i < n; i++) // this is for repetation of passes 
+	{
+		j = i - 1; // set j as one before the last 
+		x = A[i]; // the elemets that we have to insert
+		// go on shifting the elements as long as a[j] is greater then x and everytime reduce j by 1 ; j-- 
+		while (j > -1 && A[j] > x) // shifting  the elements 
+		{
+			// when place is found to insert then 
+			A[j + 1] = A[j]; // everytime at the next location copy the elemets of j
+			j--; // decrement j 
+		}
+		A[j + 1] = x; // at end copy the element at appropriate position 
+	}
+
+}
+int main()
+{
+	int A[20],no,i;
+	scanf_s("%d", &no);
+	for (i = 0; i < no; i++)
+	{
+		scanf_s("%d", &A[i]);
+	}
+	Insertionsort(A, no);
+	for (i = 0; i < no; i++)
+		printf("%d ", A[i]);
+	printf("\n");
+	return 0;
+
+}

Sorting Technique/04 InsertionSort.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+
+using namespace std;
+ 
+template <class T>
+void Print(T& vec, int n, string s){
+    cout << s << ": [" << flush;
+    for (int i=0; i<n; i++){
+        cout << vec[i] << flush;
+        if (i < n-1){
+            cout << ", " << flush;
+        }
+    }
+    cout << "]" << endl;
+}
+ 
+void InsertionSort(int A[], int n){
+    for (int i=1; i<n; i++){
+        int j = i-1;
+        int x = A[i];
+        while (j>-1 && A[j] > x){
+            A[j+1] = A[j];
+            j--;
+        }
+        A[j+1] = x;
+    }
+}
+ 
+int main() {
+ 
+    int A[] = {19, 17, 15, 13, 11, 9, 7, 5, 3, 1};
+    Print(A, sizeof(A)/sizeof(A[0]), "       A");
+ 
+    InsertionSort(A, sizeof(A)/sizeof(A[0]));
+    Print(A, sizeof(A)/sizeof(A[0]), "Sorted A");
+ 
+    return 0;
+}

Sorting Technique/05 Selection Sort.c

@@ -0,0 +1,39 @@
+#include <stdio.h>
+
+void swap(int* a, int* b)
+{
+	int temp = *a;
+	*a = *b;
+	*b = temp;
+}
+void selectionsort(int A[], int n)
+{
+	int i, j, k; // for indexes 
+	for (i = 0; i < n - 1; i++) // for passes // in 1st pass we will get the smallest element 
+	{
+		for (j = k = i; j < n; j++) // for checing all elements // keep i,j,k on 1st pos and strating moving j everytime and compare with k 
+		{
+			// move j to next element and comp with k . if j is smaller then k then bring k at j.. 
+			if (A[j] < A[k]) // if j is less then k then move k and we will 
+				k = j; // now k is pointing on the smallest elements 
+		}
+		swap(&A[i], &A[k]); // now swap k with i then we will get the smallest elements at that position (i) // in this only one swap will happen
+	}
+}
+int main()
+{
+	int no, i, A[20];
+	no = sizeof(A) / sizeof(int);
+	scanf_s("%d", &no);
+	for (i = 0; i < no; i++)
+	{
+		scanf_s("%d", &A[i]);
+	}
+	selectionsort(A, no);
+	for (i = 0; i < no; i++)
+	{
+		printf("%d ", A[i]);
+	}
+	printf("\n");
+	return 0;
+}

Sorting Technique/06 SelectionSort.cpp

@@ -0,0 +1,46 @@
+#include <iostream>
+
+using namespace std;
+ 
+template <class T>
+void Print(T& vec, int n, string s){
+    cout << s << ": [" << flush;
+    for (int i=0; i<n; i++){
+        cout << vec[i] << flush;
+        if (i < n-1){
+            cout << ", " << flush;
+        }
+    }
+    cout << "]" << endl;
+}
+ 
+void swap(int* x, int* y){
+    int temp = *x;
+    *x = *y;
+    *y = temp;
+}
+ 
+void SelectionSort(int A[], int n){
+    for (int i=0; i<n-1; i++){
+        int j;
+        int k;
+        for (j=k=i; j<n; j++){
+            if (A[j] < A[k]){
+                k = j;
+            }
+        }
+        swap(&A[i], &A[k]);
+    }
+}
+ 
+int main() {
+ 
+    int A[] = {3, 7, 9, 10, 6, 5, 12, 4, 11, 2};
+    int n = sizeof(A)/sizeof(A[0]);
+    Print(A, n, "\t\tA");
+ 
+    SelectionSort(A, n);
+    Print(A, n, " Sorted A");
+ 
+    return 0;
+}

Sorting Technique/07 Mergesort.c

@@ -0,0 +1,49 @@
+// sorting.cpp : This file contains the 'main' function. Program execution begins and ends there.
+//
+#include<stdio.h>
+
+void Merge(int A[], int l, int mid, int h) // this is for two array inside one array 
+{
+	int i = l, j = mid + 1, k = l; 
+	int B[100];
+
+	while (i <= mid && j <= h) 
+	{
+		if (A[i] < A[j])
+			B[k++] = A[i++]; // copy element from a to b 
+		else
+			B[k++] = A[j++]; // copy element from another side of a to b 
+	}
+	for (; i <= mid; i++)
+		B[k++] = A[i];
+	for (; j <= h; j++)
+		B[k++] = A[j];
+
+	for (i = l; i <= h; i++) // this is for copy all the elements from B to A( back )
+		A[i] = B[i];
+}
+void MergeSort(int A[], int l, int h)
+{
+	int mid;
+	if (l < h)
+	{
+		mid = (l + h) / 2;
+		MergeSort(A, l, mid);
+		MergeSort(A, mid + 1, h);
+		Merge(A, l, mid, h);
+
+	}
+}
+int main()
+{
+	int A[] = { 11,13,7,12,16,9,24,5,10,3 }, n = 10, i;
+
+	MergeSort(A, 0, 9);
+
+	for (i = 0; i < 10; i++)
+		printf("%d ", A[i]);
+	printf("\n");
+
+	return 0;
+}
+// time complexity = o(m+n)