Merge branch 'master' into all-contributors/add-tttson

Author: darpanjbora

.all-contributorsrc

@@ -13,6 +13,41 @@
       "contributions": [
         "code"
       ]
+    },
+      "login": "ADVAITH18",
+      "name": "ADVAITH U",
+      "avatar_url": "https://avatars0.githubusercontent.com/u/45172876?v=4",
+      "profile": "https://github.com/ADVAITH18",
+      "contributions": [
+        "code"
+      ]
+    },
+    {
+      "login": "ankurpalmia",
+      "name": "Ankur Palmia",
+      "avatar_url": "https://avatars0.githubusercontent.com/u/34860089?v=4",
+      "profile": "https://github.com/ankurpalmia",
+      "contributions": [
+        "code"
+      ]
+    },
+    {
+      "login": "JD235",
+      "name": "JD",
+      "avatar_url": "https://avatars0.githubusercontent.com/u/43887713?v=4",
+      "profile": "https://github.com/JD235",
+      "contributions": [
+        "code"
+      ]
+    },
+    {
+      "login": "syk007",
+      "name": "syk007",
+      "avatar_url": "https://avatars2.githubusercontent.com/u/31596670?v=4",
+      "profile": "https://github.com/syk007",
+      "contributions": [
+        "code"
+      ]
     }
   ],
   "contributorsPerLine": 7,

DuplicateLinesElimination/DuplicateElimination.java

@@ -0,0 +1,32 @@
+import java.io.*;
+class DuplicateElimination
+{
+	public static void main(String[] args) throws Exception
+	{
+		System.out.println("Removing Duplicate lines in file");
+		BufferedReader br1 = new BufferedReader(new FileReader("input.txt"));
+ 		PrintWriter pw = new PrintWriter("output.txt");
+		String line = br1.readLine(); 
+		while (line != null)
+		{
+			boolean available = false;
+			BufferedReader br2 = new BufferedReader( new FileReader("output.txt") );
+ 			String target = br2.readLine();
+			while (target != null)
+			{
+				if (line.equals(target) )
+				{
+					available = true;
+					 break;
+				}	
+				target = br2.readLine(); 
+			} 
+			if (available == false)
+			{
+				pw.println(line);
+				 pw.flush();
+			}
+			line = br1.readLine();
+		}
+	}
+}

DuplicateLinesElimination/input.txt

@@ -0,0 +1,6 @@
+Hello World..!!
+Hello World..!!
+Hello World..!!
+What's up :)
+What's up :)
+What's up :)

README.md

@@ -1,5 +1,5 @@
 # Java Algorithms
-[![All Contributors](https://img.shields.io/badge/all_contributors-1-orange.svg?style=flat-square)](#contributors)
+[![All Contributors](https://img.shields.io/badge/all_contributors-5-orange.svg?style=flat-square)](#contributors)
 
 ## Contributors ✨
 
@@ -10,6 +10,10 @@ Thanks goes to these wonderful people ([emoji key](https://allcontributors.org/d
 <table>
   <tr>
     <td align="center"><a href="https://github.com/tttson"><img src="https://avatars2.githubusercontent.com/u/24596895?v=4" width="100px;" alt="T"/><br /><sub><b>T</b></sub></a><br /><a href="https://github.com/darpanjbora/Java-Algorithms/commits?author=tttson" title="Code">💻</a></td>
+    <td align="center"><a href="https://github.com/ADVAITH18"><img src="https://avatars0.githubusercontent.com/u/45172876?v=4" width="100px;" alt="ADVAITH U"/><br /><sub><b>ADVAITH U</b></sub></a><br /><a href="https://github.com/darpanjbora/Java-Algorithms/commits?author=ADVAITH18" title="Code">💻</a></td>
+    <td align="center"><a href="https://github.com/ankurpalmia"><img src="https://avatars0.githubusercontent.com/u/34860089?v=4" width="100px;" alt="Ankur Palmia"/><br /><sub><b>Ankur Palmia</b></sub></a><br /><a href="https://github.com/darpanjbora/Java-Algorithms/commits?author=ankurpalmia" title="Code">💻</a></td>
+    <td align="center"><a href="https://github.com/JD235"><img src="https://avatars0.githubusercontent.com/u/43887713?v=4" width="100px;" alt="JD"/><br /><sub><b>JD</b></sub></a><br /><a href="https://github.com/darpanjbora/Java-Algorithms/commits?author=JD235" title="Code">💻</a></td>
+    <td align="center"><a href="https://github.com/syk007"><img src="https://avatars2.githubusercontent.com/u/31596670?v=4" width="100px;" alt="syk007"/><br /><sub><b>syk007</b></sub></a><br /><a href="https://github.com/darpanjbora/Java-Algorithms/commits?author=syk007" title="Code">💻</a></td>
   </tr>
 </table>
 

Sorting Algorithms/QuickSort.java

@@ -0,0 +1,77 @@
+// Java program for implementation of QuickSort 
+class QuickSort 
+{ 
+	/* This function takes last element as pivot, 
+	places the pivot element at its correct 
+	position in sorted array, and places all 
+	smaller (smaller than pivot) to left of 
+	pivot and all greater elements to right 
+	of pivot */
+	int partition(int arr[], int low, int high) 
+	{ 
+		int pivot = arr[high]; 
+		int i = (low-1); // index of smaller element 
+		for (int j=low; j<high; j++) 
+		{ 
+			// If current element is smaller than the pivot 
+			if (arr[j] < pivot) 
+			{ 
+				i++; 
+
+				// swap arr[i] and arr[j] 
+				int temp = arr[i]; 
+				arr[i] = arr[j]; 
+				arr[j] = temp; 
+			} 
+		} 
+
+		// swap arr[i+1] and arr[high] (or pivot) 
+		int temp = arr[i+1]; 
+		arr[i+1] = arr[high]; 
+		arr[high] = temp; 
+
+		return i+1; 
+	} 
+
+
+	/* The main function that implements QuickSort() 
+	arr[] --> Array to be sorted, 
+	low --> Starting index, 
+	high --> Ending index */
+	void sort(int arr[], int low, int high) 
+	{ 
+		if (low < high) 
+		{ 
+			/* pi is partitioning index, arr[pi] is 
+			now at right place */
+			int pi = partition(arr, low, high); 
+
+			// Recursively sort elements before 
+			// partition and after partition 
+			sort(arr, low, pi-1); 
+			sort(arr, pi+1, high); 
+		} 
+	} 
+
+	/* A utility function to print array of size n */
+	static void printArray(int arr[]) 
+	{ 
+		int n = arr.length; 
+		for (int i=0; i<n; ++i) 
+			System.out.print(arr[i]+" "); 
+		System.out.println(); 
+	} 
+
+	// Driver program 
+	public static void main(String args[]) 
+	{ 
+		int arr[] = {10, 7, 8, 9, 1, 5}; 
+		int n = arr.length; 
+
+		QuickSort ob = new QuickSort(); 
+		ob.sort(arr, 0, n-1); 
+
+		System.out.println("sorted array"); 
+		printArray(arr); 
+	}
+}