diff --git a/Bubble-sort.cpp b/Bubble-sort.cpp
index 4f3be43..819c6a3 100644
--- a/Bubble-sort.cpp
+++ b/Bubble-sort.cpp
@@ -5,7 +5,7 @@ void sort(int *a, int n) //a=>array, n=>length of array
  int i,j,t;
  for(i=0;i<n-1;i++)
  {
-  for(j=i+1;j<n;j++)
+  for(j=i;j<n-i-1;j++) //as last element of array gets automatically sorted.Thus, can be ignored.
   {
    if(a[i]>a[j])
    {
diff --git a/quicksort.cpp b/quicksort.cpp
new file mode 100644
index 0000000..4c694f0
--- /dev/null
+++ b/quicksort.cpp
@@ -0,0 +1,47 @@
+#include<iostream>
+#define n 8
+using namespace std;
+int partition(int a[],int first,int last){
+	int pivot=a[first],i=first,j=last+1;
+	do{
+		do{
+			++i;
+		}while(a[i]<pivot && i<=last);
+		
+		do{
+			--j;
+		}while(pivot<a[j]);
+		if(i<j){
+			int temp=a[i];
+			a[i]=a[j];
+			a[j]=temp;
+		}
+	}while(i<j);
+	a[first]=a[j];
+	a[j]=pivot;
+	return first;
+} 
+
+void quicksort(int a[],int p, int q){
+	if(p<q){
+		int x=partition(a,p,q);
+		quicksort(a,p,x-1);
+		quicksort(a,x+1,q);
+	}
+}
+void print(int a[]){
+    for(int i=0;i<n;i++){
+		cout<<a[i]<<endl;
+	}	
+}
+int main(){
+	cout<<"enter "<<n<<" elements:\n";
+	int a[n];
+	for(int i=0;i<n;i++){
+		cin>>a[i];
+	}
+	cout<<"sorted array: \n";
+	quicksort(a,0,n-1);
+	print(a);
+	return 0;
+}