/** * Created by akhil on 2/25/2015. */ class Link{ int data; Link next; public Link(int data){ this.data = data; } public void displayLink(){ System.out.println("-----"+this.data); } } class LinkedList{ private Link first; public LinkedList(){ first= null; } public void insertFirst(int data){ Link newLink = new Link(data); newLink.next = first; first = newLink; } public void display(){ Link current = first; while(current!=null){ current.displayLink(); current = current.next; } } public Link deleteFirst(){ Link temp = first; first = first.next; return temp; } } //public class LinkedListExample { public static void main(String args[]){ LinkedList linkedList = new LinkedList(); linkedList.insertFirst(2332); linkedList.insertFirst(22); linkedList.insertFirst(31); linkedList.insertFirst(11); linkedList.insertFirst(21); linkedList.insertFirst(4111); // linkedList.insertFirst(111); System.out.println("After inserting the node in front/top........."); linkedList.display(); linkedList.deleteFirst(); System.out.println("After deleting the node from front/top........."); linkedList.display(); } }
Wednesday, February 25, 2015
Stack implementation as LinkedList
Thursday, February 12, 2015
QuickSort Algorithm: Without using sort
import java.util.ArrayList; import java.util.Arrays; import java.util.Iterator; import java.util.List; import org.apache.commons.lang.ArrayUtils; /** * Created by akhilgupta on 11-02-2015. */public class QuickSortSample { public static void main(String args[]){ // int[] test = {32,23,43,2,33,12,33,11,45,56,88,10}; int[] test = {32,23,43,2,33,12,33,11,45,56,88,10,32,23,43,2,33,1,88,10,32,23,43,2,133,12,33,11,5,56,8,10}; getQuickSort(test); } static void getQuickSort(int[] test) { List<Integer> lstLower = new ArrayList(); List<Integer> lstUpper = new ArrayList(); int[] lower={}; int[] upper={}; int pivot=0; // lst.add(test); for (int i = 0; i < test.length; i++) { pivot = test[(test.length - 1) / 2]; int k = (test.length - 4) / 2; } for (int m = 0; m < test.length; m++) { if (test[m] < pivot) lstLower.add(test[m]); else lstUpper.add(test[m]); } lower = ArrayUtils.toPrimitive(lstLower.toArray(new Integer[lstLower.size()])); upper = ArrayUtils.toPrimitive(lstUpper.toArray(new Integer[lstUpper.size()])); int temp = 0; List<Integer> sumList = new ArrayList<Integer>(); sumList.addAll(swap(lower)); sumList.addAll(swap(upper)); Iterator<Integer> itr = sumList.listIterator(); while(itr.hasNext()){ Integer it = itr.next(); System.out.print(" "+it+" "); } } public static List<Integer> swap(int[] test) { //int[] test = lower; for (int m = test.length; m > 0; m--) { for (int i = 0; i < test.length - 1; i++) { int tmp = test[i + 1]; if (test[i] > tmp) { tmp = test[i]; test[i] = test[i + 1]; test[i + 1] = tmp; } } } List<Integer> finalList = new ArrayList<Integer>(); for (int n = 0; n < test.length; n++) { finalList.add(test[n]); } System.out.println("\n"); return finalList; } }
Monday, February 2, 2015
Simple Java Socket Programme
import java.io.DataInputStream; import java.io.IOException; import java.net.Socket; import java.net.ServerSocket; /** * Created by akhilgupta on 02-02-2015. */public class ServerSample { public static void main(String args[]) throws IOException{ ServerSocket server = new ServerSocket(7879); Socket ss = server.accept(); DataInputStream dataInputStream = new DataInputStream(ss.getInputStream()); System.out.println("Received is ~~~~~~~~~~~~~"+dataInputStream.readUTF()); dataInputStream.close(); ss.close(); } }
import java.io.DataInputStream; import java.io.DataOutputStream; import java.io.IOException; import java.io.InputStream; import java.net.Socket; import java.net.ServerSocket; /** * Created by akhilgupta on 02-02-2015. */public class ClientSample { public static void main(String args[]) throws IOException{ Socket socket = new Socket("localhost",7879); ServerSocket ss = new ServerSocket(); DataOutputStream dataOutputStream = new DataOutputStream(socket.getOutputStream()); String message = "test message"; dataOutputStream.writeUTF(message); dataOutputStream.flush(); dataOutputStream.close(); socket.close(); } }
Subscribe to:
Posts (Atom)