Create problem29.c

Author: rmkcodingclub

problem29.c

@@ -0,0 +1,62 @@
+/*Solved by
+R. Balaji
+*/
+
+
+#include<stdio.h>
+void quicksort(int array[], int a, int b)
+{
+    int pivotIndex, temp, index1, index2;
+
+    if(a < b)
+    {
+        pivotIndex = a;
+        index1 = a;
+        index2 = b;
+        while(index1 < index2)
+        {
+            while(array[index1] <= array[pivotIndex] && index1 < b)
+            {
+                index1++;
+            }
+            while(array[index2]>array[pivotIndex])
+            {
+                index2--;
+            }
+
+            if(index1<index2)
+            {
+                 temp = array[index1];
+                array[index1] = array[index2];
+                array[index2] = temp;
+            }
+        }
+
+        temp = array[pivotIndex];
+        array[pivotIndex] = array[index2];
+        array[index2] = temp;
+
+        quicksort(array, a, index2-1);
+        quicksort(array, index2+1, b);
+    }
+}
+
+int main()
+{
+ 
+    int array[100],n,i;
+	printf("Enter the number of element you want to Sort : ");
+    	scanf("%d",&n);
+	printf("Enter Elements in the list : ");
+    for(i = 0; i < n; i++)
+    {
+        scanf("%d",&array[i]);
+    }
+    quicksort(array,0,n-1);
+    printf("The Second largest element in Sorted elements: ");
+    /*for(i=0;i<n;i++)
+    printf(" %d",array[i]);*/
+	printf("%d",array[n-2]);
+
+    return 0;
+}