Data Structure & Algorithm

Data structure in java sorting in data structure selection sorting    selection sorting ascending order      Example program selection sorting ascending order package sortingInJava; public class selectionSortingDescending { public int max(int[] arr,int from) { int maxValue=arr[from]; int maxVIndex=from; for(int i=from+1;i<arr.length;i++) { if(maxValue<arr[i]) { maxValue=arr[i]; maxVIndex=i; } } return maxVIndex; } public int[] selectionSortedArray(int[] arr) { for(int i=0;i<arr.length;i++) { int maxVIndex=this.max(arr, i); int temp=arr[i]; arr[i]=arr[maxVIndex]; arr[maxVIndex]=temp; } return arr; } public static void main(String arg[]) { int[] arr={510,222,3,422,110}; arr=new selectionSorting().selectionSortedArray(arr); for(int i:arr) System.out.println(i); } } output insertion sorting insertion sorting with descending order insertion sorting with ascending order selection sorti...

Data structure in java sorting in data structure selection sorting selection sorting with descending order Example program selection sorting ascending order package sortingInJava; public class selectionSorting { public int min(int[] arr,int from) { int minValue=arr[from]; int minVIndex=from; for(int i=from+1;i<arr.length;i++) { if(minValue<arr[i]) { minValue=arr[i]; minVIndex=i; } } return minVIndex; } public int[] selectionSortedArray(int[] arr) { for(int i=0;i<arr.length;i++) { int minVIndex=this.min(arr, i); int temp=arr[i]; arr[i]=arr[minVIndex]; arr[minVIndex]=temp; } return arr; } public static void main(String arg[]) { int[] arr={510,222,3,422,110}; arr=new selectionSorting().selectionSortedArray(arr); for(int i:arr) System.out.println(i); } } output insertion sorting insertion sorting with descending order insertion sorting with ascending order selection sorting selection sorting with descendi...

data structure in java example program  getting smallest value using array from specific position package sortingInJava; public class Example { public int min(int[] arr,int from) { int minValue=arr[from]; for(int i=from+1;i<arr.length;i++) { minValue=arr[i]; } } return minValue; } public static void main(String arg[]) { int[] arr= {0,222,3,422,0}; System.out.println(new Example().min(arr,1)); } }

data structure in java example public class example{ public int min(int[] arr,int from) { int minValue=arr[from]; int minVIndex=from; for(int i=from+1;i arr[i]) { minValue=arr[i]; minVIndex=i; } } return minVIndex; } public static void main(String arg[]) { int[] arr= {0,222,3,422,0}; System.out.println(new example().min(arr,1)); } }

Data structure in java sorting in data structure       insertion sorting ascending order                  Example program descending order package sortingInJava; public class InsertionSortingExample { public int[] insertionSorting(int[] arr) { if(arr.length>0) { int i,j; for(i=1;i<arr.length;i++) { int temp=arr[i]; for(j=i-1;j>=0;j--) { if(temp<arr[j]) break; arr[j+1]=arr[j]; }//end inner loop arr[j+1]=temp; }//end outer loop } else { System.out.println("Array is empty"); } return arr; }//method ended public static void main(String ar[]) { int[] arr= {4,10,5,3,1,2,6}; System.out.println("Original arr:"); for(int a:arr) { System.out.print(a+" "); } System.out.println(""); System.out.println("Sorted array:"); int[] sortedArr=new InsertionSortingExample().insertionSorting(arr); for(int a:sortedArr) { Syst...

Data structure java sorting in data structure example descending order Example Program ascending order package sortingInJava; public class InsertionSortingExample { public int[] insertionSorting(int[] arr) { if(arr.length>0) { int i,j; for(i=1;i =0;j--) { if(temp>arr[j]) break; arr[j+1]=arr[j]; }//end inner loop arr[j+1]=temp; }//end outer loop } else { System.out.println("Array is empty"); } return arr; }//method ended public static void main(String ar[]) { int[] arr= {4,10,5,3,1,2,6}; System.out.println("Original arr:"); for(int a:arr) { System.out.print(a+" "); } System.out.println(""); System.out.println("Sorted array:"); int[] sortedArr=new InsertionSortingExample().insertionSorting(arr); for(int a:sortedArr) { System.out.print(a+" "); } } } output insertion sorting descending order

Stack:-stack used in data structure to insert and delete element from top. LIFO:-Last In First Out. Following example illustrate Stack. class MyStack { private int SIZE; private int top=-1; private int[] arr; MyStack() { SIZE=5; arr=new int[5]; } MyStack(int SIZE) { this.SIZE=SIZE; arr=new int[SIZE]; }     //empty method public boolean isEmpty() { return top==-1; } //full method public boolean isFull() { return top==SIZE-1; }     //push method public void push(int num) { if(isFull()) { System.out.println("push perform on full Stack"); } else { top++; arr[top]=num; System.out.println(num+" is pushed"); } }     //pop method public int pop() { if(isEmpty()) { System.out.println("pop perform on empty stack"); return -000; } else { int x=arr[top]; top--; System.out.println(x+" is pop"); return x; } } } class TestStack { publi...

Queue:-queue is used in data structure to insert data at the end and remove at top. following are complete example of queue. public class Queue { int rear=-1; int front=-1; int size; int qArr[]; Queue (){ size=10; qArr=new int[size];  } Queue (int a){ size=a; qArr=new int[size];  } public boolean  isEmpty()                    { if(rear==front) return true; else return false;                  } public boolean isfull() { if(rear==size-1) return true; else return false;   } public void enqueue(int n) { if(isfull()) { System.out.println("Queue is full."); } else { if(front==-1) front++; rear++; qArr[rear]=n;        } } public int dequeue() {int temp=-9999; if(isEmpty()) { System.out.println("Stack is empty!"); } else { temp=qArr[fron...