Linked list

JAVA/.classpath

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER"/>
+	<classpathentry excluding="merge_sort/src/|quick_sort/src/" kind="src" path=""/>
+	<classpathentry kind="src" path="merge_sort/src"/>
+	<classpathentry kind="src" path="quick_sort/src"/>
+	<classpathentry kind="output" path="merge_sort/out/production/merge_sort"/>
+</classpath>

JAVA/.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>JAVA</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

JAVA/Linked_List/LinkedList.java

@@ -0,0 +1,114 @@
+package Linked_List;
+
+public class LinkedList {
+	//intitializing head to null
+		Node head = null;
+		//declaring a runner pointer variable
+		Node runner;
+		//declaring size variable
+		int size = 0;
+
+		public void add(int data) {
+			Node n = new Node();
+			n.data = data;
+			if(head == null) {
+				head = n;
+			}
+			else {
+				runner = head;
+				//traverse to end
+				while(runner.next != null) {
+					runner = runner.next;
+				}
+				runner.next = n;
+			}
+			size++;
+		}
+		public void insertAtBegin(int data) {
+			Node n = new Node();
+			n.data = data;
+			n.next = head;
+			head = n;
+			size++;
+		}
+		public void inserAt(int data, int pos) {
+			Node n = new Node();
+			n.data = data;
+			if(pos < 0 || pos > size) {
+				throw new IllegalArgumentException();
+			}
+			else {
+				runner = head;
+				//traverse at 1 before pos
+				for(int i=0; i<pos-1; i++) {
+					runner = runner.next;
+				}
+				n.next = runner.next;
+				runner.next = n;
+			}
+			size++;
+		}
+
+		public void deleteAt(int pos) {
+			if(pos == 0) {
+				head = head.next;
+			}
+			else {
+				runner = head;
+				//traverse to 1 before pos
+				for(int i=0; i<pos-1; i++) {
+					runner = runner.next;
+				}
+				runner.next = runner.next.next;
+			}
+			size--;
+		}
+
+		public int get(int pos) {
+			runner = head;
+			for(int i=0; i<=pos; i++) {
+				if(i == pos) {
+					return runner.data;
+				}
+				runner = runner.next;
+			}
+			return -1;
+		}
+
+		public void print() {
+			runner = head;
+			while(runner != null) {
+				System.out.println(runner.data);
+				runner = runner.next;
+			}
+		}
+		public boolean contains(int data) {
+			if(head == null) {
+				return false;
+			}
+			runner = head;
+			while(runner != null) {
+				if(runner.data == data) {
+					return true;
+				}
+				runner = runner.next;
+			}
+			return false;
+		}
+		public void clear() {
+			head = null;
+			size = 0;
+		}
+		public int size() {
+			return size;
+		}
+		public boolean isEmpty() {
+			if(head == null) {
+				return true;
+			}
+			else {
+				return false;
+			}
+		}
+
+}

JAVA/Linked_List/Node.java

@@ -0,0 +1,6 @@
+package Linked_List;
+
+public class Node {
+	int data;
+	Node next;
+}

JAVA/Linked_List/Test.java

@@ -0,0 +1,37 @@
+package Linked_List;
+
+
+public class Test {
+
+	public static void main(String[] args) {
+		// TODO Auto-generated method stub
+		LinkedList s1 = new LinkedList();
+
+		System.out.println(s1.isEmpty());
+		s1.add(10);	
+		System.out.println();
+		s1.print();
+		s1.add(20);
+		s1.add(30);
+		s1.print();
+		System.out.println();
+		System.out.println(s1.isEmpty());
+		s1.insertAtBegin(100);
+		System.out.println();
+		s1.print();
+		s1.inserAt(200, 2);
+		System.out.println();
+		s1.print();
+		s1.deleteAt(3);
+		System.out.println();
+		s1.print();
+		System.out.println();
+		System.out.println(s1.get(2));
+		System.out.println();
+		System.out.println(s1.contains(2000));
+
+
+
+	}
+
+}

JAVA/merge_sort/out/production/merge_sort/.gitignore

@@ -0,0 +1,24 @@
+/.classpath
+/.project
+/AreaOfPi.class
+/DiameterOfBinaryTree.class
+/DiamondPattern.class
+/DoubleLLImplementation$Node.class
+/DoubleLLImplementation.class
+/FibonacciSeries.class
+/FindPalindrome.class
+/LifeGame.class
+/LinearSearch.class
+/Paln.class
+/Program to calculate power of a number using for loop
+/ReverseInteger.class
+/ReverseString.class
+/SwapNumbers.class
+/TowerOfHanoi.class
+/TreeNode.class
+/VowelConsonant.class
+/com/
+/floyd.class
+/merge_sort/
+/quick_sort/
+/Linked_List/