From ff09e0a866ff53239ebdd742be375fdfa9e24b63 Mon Sep 17 00:00:00 2001
From: Rimjhim27 <rimjhimraj2000@hotmail.com>
Date: Fri, 16 Oct 2020 16:20:02 +0530
Subject: [PATCH 1/2] Pell Numbers Series

---
 Java/pell.java | 21 +++++++++++++++++++++
 1 file changed, 21 insertions(+)
 create mode 100644 Java/pell.java

diff --git a/Java/pell.java b/Java/pell.java
new file mode 100644
index 0000000..9351e5a
--- /dev/null
+++ b/Java/pell.java
@@ -0,0 +1,21 @@
+import java.io.*;
+import java.util.*;
+
+class pell{
+    
+    public static void main(String args[])
+    {
+    Scanner sc = new Scanner(System.in);    
+    //User input of the number of pell numbers
+    int n = sc.nextInt();
+    int a=1,b=0,c,i;
+    System.out.println("First "+n+" Pell numbers are: ");
+    for(i=1; i<=n; i++)
+     {
+      c= a + 2*b;
+      System.out.print(c+" ");
+      a = b;
+      b = c;
+     }
+   }
+}
\ No newline at end of file

From cb44109236bf8e409b87a3ab321ce24348ca169c Mon Sep 17 00:00:00 2001
From: Rimjhim27 <rimjhimraj2000@hotmail.com>
Date: Fri, 16 Oct 2020 16:23:31 +0530
Subject: [PATCH 2/2] Pell Numbers

---
 C++/Sorting algo/quicksort.cpp | 109 ++++++++++++++++++++-------------
 1 file changed, 67 insertions(+), 42 deletions(-)

diff --git a/C++/Sorting algo/quicksort.cpp b/C++/Sorting algo/quicksort.cpp
index f5c6726..0ef3cbe 100644
--- a/C++/Sorting algo/quicksort.cpp	
+++ b/C++/Sorting algo/quicksort.cpp	
@@ -1,42 +1,67 @@
-// A utility function to swap two elements  
-void swap(int* a, int* b)  
-{  
-    int t = *a;  
-    *a = *b;  
-    *b = t;  
-}  
-int partition (int arr[], int low, int high)  
-{  
-    int pivot = arr[high]; // pivot  
-    int i = (low - 1); // Index of smaller element  
-  
-    for (int j = low; j <= high - 1; j++)  
-    {  
-        // If current element is smaller than the pivot  
-        if (arr[j] < pivot)  
-        {  
-            i++; // increment index of smaller element  
-            swap(&arr[i], &arr[j]);  
-        }  
-    }  
-    swap(&arr[i + 1], &arr[high]);  
-    return (i + 1);  
-}  
-
- void quickSort(int arr[], int low, int high)  
-{  
-    if (low < high)  
-    {  
-        int pi = partition(arr, low, high);   
-       quickSort(arr, low, pi - 1);  
-       quickSort(arr, pi + 1, high);  
-   }  
-}  
-/* Function to print an array */
-void printArray(int arr[], int size)  
-{  
-    int i;  
-    for (i = 0; i < size; i++)  
-        cout << arr[i] << " ";  
-    cout << endl;  
-}   
\ No newline at end of file
+#include <iostream>
+#include<vector>
+#include<algorithm>
+#include<utility>
+#include<set>
+#include<map>
+#include<unordered_map>
+using namespace std;
+
+
+
+int partition (int arr[], int low, int high) 
+{ 
+	int pivot = arr[high]; // pivot 
+	int i = (low - 1); // Index of smaller element 
+
+	for (int j = low; j <= high- 1; j++) 
+	{ 
+		// If current element is smaller than or 
+		// equal to pivot 
+		if (arr[j] <= pivot) 
+		{ 
+			i++; // increment index of smaller element 
+			swap(arr[i], arr[j]); 
+		} 
+	} 
+	swap(arr[i + 1], arr[high]); 
+	return (i + 1); 
+} 
+
+
+void quickSort(int arr[], int low, int high) 
+{ 
+	if (low < high) 
+	{ 
+		/* pi is partitioning index, arr[p] is now 
+		at right place */
+		int pi = partition(arr, low, high); 
+
+		// Separately sort elements before 
+		// partition and after partition 
+		quickSort(arr, low, pi - 1); 
+		quickSort(arr, pi + 1, high); 
+	} 
+} 
+
+
+void printArray(int arr[], int size) 
+{ 
+	int i; 
+	for (i=0; i < size; i++) 
+		cout<<arr[i]<<" "; 
+	cout<<endl;
+} 
+
+int main() 
+{ 
+	int arr[] = {10, 7, 8, 9, 1, 5}; 
+	int n = sizeof(arr)/sizeof(arr[0]); 
+	
+	cout<<"Unsorted array:"<<"\n"; 
+	printArray(arr, n); 
+	quickSort(arr, 0, n-1); 
+	cout<<"Sorted array:"<<"\n"; 
+	printArray(arr, n); 
+	return 0; 
+}