Add files via upload

Author: skjha1

Diff for: 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)

Diff for: 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;
+}