Sorted linked list in Java

Author: Deepali-Srivastava

linked-list/sortedLinkedList/Demo.java

@@ -0,0 +1,52 @@
+/*
+Copyright (C) Deepali Srivastava - All Rights Reserved
+This code is part of DSA course available on CourseGalaxy.com    
+*/
+
+package sortedLinkedList;
+
+import java.util.Scanner;
+
+public class Demo 
+{
+	public static void main(String[] args)
+	{ 
+		int choice,data;
+	
+	    Scanner scan = new Scanner(System.in);	
+	
+  	    SortedLinkedList List = new SortedLinkedList();
+  	    List.createList();
+   
+	    while(true)
+	    {
+		  System.out.println("1.Display List");
+		  System.out.println("2.Insert a new node");
+		  System.out.println("3.Search");
+		  System.out.println("4.Exit");
+		  System.out.print("Enter your choice : ");
+		  choice = scan.nextInt();
+		  if(choice==4)
+			 break;
+		
+		  switch(choice)
+		  {
+		    case 1:
+			  List.displayList();
+			  break;
+		    case 2:
+			  System.out.println("Enter the element to be inserted : ");
+			  data = scan.nextInt();
+			  List.insertInOrder(data);
+			  break;
+		    case 3:
+			   System.out.println("Enter the element to be searched : ");
+			   data=scan.nextInt();
+			   List.search(data);
+			   break;
+		  default:
+			   System.out.println("Wrong choice\n");
+		}
+	}/*End of while*/
+  }/*End of main()*/
+}

linked-list/sortedLinkedList/Node.java

@@ -0,0 +1,17 @@
+/*
+Copyright (C) Deepali Srivastava - All Rights Reserved
+This code is part of DSA course available on CourseGalaxy.com    
+*/
+
+package sortedLinkedList;
+
+public class Node 
+{
+	public int info;  
+    public Node link;
+   
+    public Node(int i) 
+	{
+		info=i;
+	}
+}

linked-list/sortedLinkedList/SortedLinkedList.java

@@ -0,0 +1,100 @@
+/*
+Copyright (C) Deepali Srivastava - All Rights Reserved
+This code is part of DSA course available on CourseGalaxy.com    
+*/
+
+package sortedLinkedList;
+
+import java.util.Scanner;
+
+public class SortedLinkedList 
+{
+	private Node start;
+	
+	public SortedLinkedList()
+	{
+	      start=null;
+	}
+	public void insertInOrder(int data)
+	{
+		Node temp=new Node(data);
+			
+		/*List empty or new node to be inserted before first node*/
+		if(start==null || data<start.info)
+		{
+			temp.link=start;
+			start=temp;
+			return;
+		}
+
+		Node p=start;
+		while(p.link!=null && p.link.info <= data)
+			p=p.link;
+
+		temp.link=p.link;
+		p.link=temp;
+	}/*End of insertInOrder()*/
+
+	public void createList()
+	{
+		int i,n,data;
+		
+		Scanner scan = new Scanner(System.in); 
+				
+		System.out.print("Enter the number of nodes : ");
+		n = scan.nextInt();
+		
+		if(n==0)
+			return;
+		
+		for(i=1; i<=n; i++)
+		{
+			System.out.print("Enter the element to be inserted : ");
+			data = scan.nextInt();
+			insertInOrder(data);
+		}
+	}/*End of createList()*/
+
+	public void search(int x)
+	{
+		if(start==null)
+		{
+			System.out.println("List is empty");
+			return;
+		}
+
+		Node p=start;
+		int position=1;
+		while(p!=null && p.info<=x)
+		{
+			if(p.info==x)
+				break;
+			position++;
+			p=p.link;
+		}
+		if(p==null || p.info!=x)
+			System.out.println(x + " not found in list");
+		else
+			System.out.println(x + " is at position " + position);	
+	}/*End of search()*/
+	
+	public void displayList()
+	{
+		Node p;
+		if(start==null)
+		{
+			System.out.println("List is empty");
+			return;
+		}
+		System.out.print("List is :   ");
+		p=start;
+		while(p!=null)
+		{
+			System.out.print(p.info + "  ");
+			p=p.link;
+		}
+		System.out.println();
+	}/*End of displayList()*/
+	
+	
+}