Develop a sort implementation that counts the number of different key values,then uses a symbol table to apply key-indexed counting to sort the array. (This methodis not for use when the number of different key values is large.)

Implement substringList() that will produce the collection of words from the 1D array B that has substrings equivalent to the string key. The resulting collection should be stored in array C and this should contain only the unique set of words. The function returns the resulting total number of elements in array C. For your reference, a substring is a contiguous sequence of characters within a string. As an example, the strings “app”, “ppl”, “apple”, and “e” are among the substrings from the string “apple”. But, strings “ale” are “elppa” are not substrings from string “apple”. key = "or" array B = {"it's", "today", "now", "or", "forever", "today", "ACT"} array C should be {"or", "forever"}   Rules: You can only use strcmp, strcat, and strcpy Maximize the use of loops (e.g., for) you can create local variables that can aid you

Develop an implementation of insertion sort that moves larger elements to the right one position with one array access per entry, rather than using exch(). Use SortCompare to evaluate the effectiveness of doing so

Java! please explain clearly with the answer by hand-writing or typing Using merge sort to sort an array of size n, then use binary search to find (1/2)n elements. Using merge sort to sort an array of size n, then run sequential search on it.

DO NOT POST EXISTING ONE:   Write a java method called SearchKey that return the indices of the first and the last occurences of an element k in an array.The function should Return [-1,1] in case the element was not found

Java Bubble Sort but make it read the data 64, 34, 25, 12, 22, 11, 90 from a file not an array // Java program for implementation of Bubble Sort class BubbleSort {     void bubbleSort(int arr[])     {         int n = arr.length;         for (int i = 0; i < n - 1; i++)             for (int j = 0; j < n - i - 1; j++)                 if (arr[j] > arr[j + 1]) {                     // swap arr[j+1] and arr[j]                     int temp = arr[j];                     arr[j] = arr[j + 1];                     arr[j + 1] = temp;                 }     }       /* Prints the array */     void printArray(int arr[])     {         int n = arr.length;         for (int i = 0; i < n; ++i)             System.out.print(arr[i] + " ");         System.out.println();     }       // Driver method to test above     public static void main(String args[])     {         BubbleSort ob = new BubbleSort();         int arr[] = { 64, 34, 25, 12, 22, 11, 90 }; // make it read from a file instead of having…

Write a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.

Write a program to searchelement from an array by usingbinary search approach andmake use of pointers for eachand every variable and constantand array.

Write a program to implement insertion sort and also test this using an unsorted array in java