Add files via upload

Author: skjha1

Sorting Technique/09 Iterative Mergesort.c

@@ -0,0 +1,59 @@
+// 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;  // it sud be initizlized 
+	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 IMergeSort(int A[], int n)
+{
+	int p, l, h, mid, i;
+	for (p = 2; p <= n; p = p * 2) // for passes // always list size will be doubled 
+	{
+		for (i = 0; i + p - 1 < n; i = i + p) // for the sub lsit // merging all list in a single pass // i sud incremented by i  + p 
+		{
+			l = i; // every pass modify the low , mid and high value 
+			h = i + p - 1;
+			mid = (l + h) / 2;
+			Merge(A, l, mid, h); // call merge fxn 
+		}
+		if (n - i > p / 2)
+		{
+			l = i;
+			h = i + p - 1;
+			mid = (l + h) / 2;
+			Merge(A, l, mid, n - 1);
+		}
+	}
+	if (p / 2 < n) // if there are some more elements remaning then we sud merge it as it is 
+	{
+		Merge(A, 0, p / 2 - 1, n - 1); // call merge 
+	}
+}
+int main()
+{
+	int A[] = { 11,5,14,2,6,3,1 }, n = 7, i;
+	IMergeSort(A, n);
+	for (i = 0; i < n; i++)
+		printf("%d ", A[i]);
+	printf("\n");
+	return 0;
+}
+// time complexity = o(m+n)

Sorting Technique/10 IterativeMergeSort.cpp

@@ -0,0 +1,65 @@
+#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 Merge(int A[], int low, int mid, int high){
+    int i = low;
+    int j = mid+1;
+    int k = low;
+    int B[high+1];
+    while (i <= mid && j <= high){
+        if (A[i] < A[j]){
+            B[k++] = A[i++];
+        } else {
+            B[k++] = A[j++];
+        }
+    }
+    while (i <= mid){
+        B[k++] = A[i++];
+    }
+    while (j <= high){
+        B[k++] = A[j++];
+    }
+    for (int i=low; i<=high; i++){
+        A[i] = B[i];
+    }
+}
+ 
+void IterativeMergeSort(int A[], int n){
+    int p;
+    for (p=2; p<=n; p=p*2){
+        for (int i=0; i+p-1<n; i=i+p){
+            int low = i;
+            int high = i+p-1;
+            int mid = (low+high)/2;
+            Merge(A, low, mid, high);
+        }
+    }
+    if (p/2 < n){
+        Merge(A, 0, p/2-1, n-1);
+    }
+}
+ 
+int main() {
+ 
+    int A[] = {2, 5, 8, 12, 3, 6, 7, 10};
+    int n = sizeof(A)/sizeof(A[0]);
+ 
+    Print(A, n, "\t\tA");
+    IterativeMergeSort(A, n);
+    Print(A, n, " Sorted A");
+ 
+    return 0;
+}