Merge pull request #39 from ng29/master

Modified selection sort

Author: piyush6348

Sorting/Selectionsort.cpp

@@ -1,31 +1,33 @@
-//
-// Created by Tay on 10/10/17.
-//
-
-void selectionSort(int table[], int size) {
-    int min, tmp;
-    for (int i = 0; i < size - 1; i++) {
-        min = i;
-        for (int j = i + 1; j < size; j++) {
-            if (table[j] < table[min]) {
-                min = j;
-            }
-        }
-        if (min != i) {
-            tmp = table[i];
-            table[i] = table[min];
-            table[min] = tmp;
-        }
-        for (int a = 0; a < 7; a++) {
-            std::cout << table[a] << " ";
-
-        }
-        std::cout << std::endl;
-    }
+#include<iostream.h>
+#include<conio.h>
+void main()
+{
+	clrscr();
+	int size, arr[50], i, j, temp;
+	cout<<"Enter Array Size : ";
+	cin>>size;
+	cout<<"Enter Array Elements : ";
+	for(i=0; i<size; i++)
+	{
+		cin>>arr[i];
+	}
+	cout<<"Sorting array using selection sort...\n";
+	for(i=0; i<size; i++)
+	{
+		for(j=i+1; j<size; j++)
+		{
+			if(arr[i]>arr[j])
+			{
+				temp=arr[i];
+				arr[i]=arr[j];
+				arr[j]=temp;
+			}
+		}
+	}
+	cout<<"Now the Array after sorting is :\n";
+	for(i=0; i<size; i++)
+	{
+		cout<<arr[i]<<" ";
+	}
+	getch();
 }
-
-int main() {
-    int table[] = {13, 32, 43, 14, 25};
-    selectionSort(table, 5);
-    return 0;
-}

Sorting/bubblesort.cpp

@@ -1,24 +1,34 @@
-#include<bits/stdc++.h>
-using namespace std;
-
-void bubbleSort(int a[], int s) {
-    for (int i = 1; i < s; i++) {
-        bool swapped = false;
-
-        for (int j = 0; j < s - i; j++) {
-            if (a[j] > a[j + 1]) {
-                std::swap(a[j], a[j + 1]);
-                swapped = true;
-            }
-        }
-
-        if (!swapped) {
-            return;
-        }
+#include <stdio.h>
+ 
+int main()
+{
+  int array[100], n, c, d, swap;
+ 
+  printf("Enter number of elements\n");
+  scanf("%d", &n);
+ 
+  printf("Enter %d integers\n", n);
+ 
+  for (c = 0; c < n; c++)
+    scanf("%d", &array[c]);
+ 
+  for (c = 0 ; c < ( n - 1 ); c++)
+  {
+    for (d = 0 ; d < n - c - 1; d++)
+    {
+      if (array[d] > array[d+1]) /* For decreasing order use < */
+      {
+        swap       = array[d];
+        array[d]   = array[d+1];
+        array[d+1] = swap;
+      }
     }
+  }
+ 
+  printf("Sorted list in ascending order:\n");
+ 
+  for ( c = 0 ; c < n ; c++ )
+     printf("%d\n", array[c]);
+ 
+  return 0;
 }
-
-void main(){
-	int a[]={13,32,43,14,25};
-	bubbleSort(a,5);
-}