IET

 singlelinkedlist package com.demo.linkedlist; public class SinglyLinkedList { class Node{ int data; Node next; public Node(int data) { super(); this.data = data; this.next=null; } }    Node head; public SinglyLinkedList() { head=null; } //add newnode at the end public void addNode(int val){ //to create a new node Node newnode=new Node(val); //if list is empty, then add at the begining if(head==null) { head=newnode; }else { Node temp=head; while(temp.next!=null) { temp=temp.next; } temp.next=newnode; } } public int searchbyvalue(int val) { if(head==null) { System.out.println("List is empty"); }else { Node temp=head; int pos=0; while(temp!=null && temp.data!=val) { temp=temp.next; pos++; } if(temp!=null) { return pos; } } return -1; } public void addByPosition(int val,int pos) { if(head==null &...

 bubblesort package com.demo.test; import java.lang.reflect.Array; import java.util.Arrays; public class TestBubbleSort { public static void main(String[] args) { int[] arr= {65,35,26,13,23,12,91}; System.out.println("Given array :"); System.out.println(Arrays.toString(arr)); bubbleSort(arr); System.out.println("sorted array"); System.out.println(Arrays.toString(arr)); } private static void improvedbubbleSort(int[] arr) { int n=arr.length; int swapcount=0; for(int i=0;i<n;i++) { for(int j=1;j<(n-i);j++) { //swapping data if(arr[j-1]>arr[j]) { int temp=arr[j]; arr[j]=arr[j-1]; arr[j-1]=temp; swapcount++; } } System.out.println("iteration "+(i+1)+" Swapcount : "+swapcount); System.out.println(Arrays.toString(arr)); if(swapcount==0) { break; } swapcount=0; } private static void bubbleSort(int[] arr) { int n=arr.length; ...