Java Insightz

package com.sbs.java8.praticse; public class StringCompression { public StringCompression() { // TODO Auto-generated constructor stub } public static void main(String[] args) { System.out.println(compressString("aaaabbbbbccccAAAAccccccccdefg")); } public static String compressString(String str) { //String str = "aaaabbbbbcccc"; char[] charArray = str.toCharArray(); String compressedString = ""; int i = 0; while (i charArray.length)? str: compressedString; return output; } }

public class BasicSortings { public static void main(String[] args) { int temp; int iterationCount = 0; int array[] = { 2, 33, 29, 30, 21, 98}; //Bubble sort or Simple sort for (int i = 0; i array[j]) { temp = array[i]; array[i] = array[j]; array[j] = temp; } iterationCount++; } } System.out.println("Bubble Sort Big 0(n) --> " + iterationCount); for (int s = 0; s //Selection Sort iterationCount =0; int sortPointer=0; for (int i = sortPointer; i array[j]) { temp = array[i]; array[i] = array[j]; array[j] = temp; } iterationCount++; } sortPointer++; } System.out.println("Selection Sort Big 0(n) --> " + iterationCount); for (int s = 0; s //Insertion Sort iterationCount=0; for (int i = 1; i 0;j--) // Inner loop travers back wards { if(array[j-1]>array[j]) { temp = array[j-1]; array[j-1] ...