Patch 2

Quick Sort

@@ -0,0 +1,48 @@
+#include<stdio.h>
+void quicksort(int number[25],int first,int last){
+   int i, j, pivot, temp;
+
+   if(first<last){
+      pivot=first;
+      i=first;
+      j=last;
+
+      while(i<j){
+         while(number[i]<=number[pivot]&&i<last)
+            i++;
+         while(number[j]>number[pivot])
+            j--;
+         if(i<j){
+            temp=number[i];
+            number[i]=number[j];
+            number[j]=temp;
+         }
+      }
+
+      temp=number[pivot];
+      number[pivot]=number[j];
+      number[j]=temp;
+      quicksort(number,first,j-1);
+      quicksort(number,j+1,last);
+
+   }
+}
+
+int main(){
+   int i, count, number[25];
+
+   printf("How many elements are u going to enter?: ");
+   scanf("%d",&count);
+
+   printf("Enter %d elements: ", count);
+   for(i=0;i<count;i++)
+      scanf("%d",&number[i]);
+
+   quicksort(number,0,count-1);
+
+   printf("Order of Sorted elements: ");
+   for(i=0;i<count;i++)
+      printf(" %d",number[i]);
+
+   return 0;
+}

c++ fibonachchi

@@ -0,0 +1,31 @@
+#include <iostream>  
+
+using namespace std;  
+
+int main() {  
+
+  int n1=0,n2=1,n3,i,number;    
+
+ cout<<"Enter the number of elements: ";    
+
+ cin>>number;    
+
+ cout<<n1<<" "<<n2<<" "; //printing 0 and 1    
+
+ for(i=2;i<number;++i) //loop starts from 2 because 0 and 1 are already printed    
+
+ {    
+
+  n3=n1+n2;    
+
+  cout<<n3<<" ";    
+
+  n1=n2;    
+
+  n2=n3;    
+
+ }    
+
+   return 0;  
+
+   }