Heap Sort added

Author: soumyadip007

Sorting/QuickSort-Copy1.ipynb

@@ -0,0 +1,71 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Sorted array is:\n",
+      "1\n",
+      "5\n",
+      "7\n",
+      "8\n",
+      "9\n",
+      "10\n"
+     ]
+    }
+   ],
+   "source": [
+    "def partition(arr,low,high): \n",
+    "    i = ( low-1 )         \n",
+    "    pivot = arr[high]\n",
+    "  \n",
+    "    for j in range(low , high): \n",
+    "        if   arr[j] <= pivot: \n",
+    "            i = i+1 \n",
+    "            arr[i],arr[j] = arr[j],arr[i] \n",
+    "    arr[i+1],arr[high] = arr[high],arr[i+1] \n",
+    "    return ( i+1 ) \n",
+    "  \n",
+    "def quickSort(arr,low,high): \n",
+    "    if low < high:\n",
+    "        pi = partition(arr,low,high) \n",
+    "        quickSort(arr, low, pi-1) \n",
+    "        quickSort(arr, pi+1, high) \n",
+    "  \n",
+    "\n",
+    "arr = [10, 7, 8, 9, 1, 5] \n",
+    "n = len(arr) \n",
+    "quickSort(arr,0,n-1) \n",
+    "print (\"Sorted array is:\") \n",
+    "for i in range(n): \n",
+    "    print (\"%d\" %arr[i]), "
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3",
+   "language": "python",
+   "name": "python3"
+  },
+  "language_info": {
+   "codemirror_mode": {
+    "name": "ipython",
+    "version": 3
+   },
+   "file_extension": ".py",
+   "mimetype": "text/x-python",
+   "name": "python",
+   "nbconvert_exporter": "python",
+   "pygments_lexer": "ipython3",
+   "version": "3.7.4"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 4
+}

Sorting/QuickSort.ipynb

@@ -2,7 +2,7 @@
  "cells": [
   {
    "cell_type": "code",
-   "execution_count": 2,
+   "execution_count": 3,
    "metadata": {},
    "outputs": [
     {
@@ -25,37 +25,19 @@
     "    pivot = arr[high]\n",
     "  \n",
     "    for j in range(low , high): \n",
-    "  \n",
-    "        # If current element is smaller than or \n",
-    "        # equal to pivot \n",
     "        if   arr[j] <= pivot: \n",
-    "          \n",
-    "            # increment index of smaller element \n",
     "            i = i+1 \n",
     "            arr[i],arr[j] = arr[j],arr[i] \n",
-    "  \n",
     "    arr[i+1],arr[high] = arr[high],arr[i+1] \n",
     "    return ( i+1 ) \n",
     "  \n",
-    "# The main function that implements QuickSort \n",
-    "# arr[] --> Array to be sorted, \n",
-    "# low  --> Starting index, \n",
-    "# high  --> Ending index \n",
-    "  \n",
-    "# Function to do Quick sort \n",
     "def quickSort(arr,low,high): \n",
-    "    if low < high: \n",
-    "  \n",
-    "        # pi is partitioning index, arr[p] is now \n",
-    "        # at right place \n",
+    "    if low < high:\n",
     "        pi = partition(arr,low,high) \n",
-    "  \n",
-    "        # Separately sort elements before \n",
-    "        # partition and after partition \n",
     "        quickSort(arr, low, pi-1) \n",
     "        quickSort(arr, pi+1, high) \n",
     "  \n",
-    "# Driver code to test above \n",
+    "\n",
     "arr = [10, 7, 8, 9, 1, 5] \n",
     "n = len(arr) \n",
     "quickSort(arr,0,n-1) \n",