Consider the array L = 387, 690, 234 435 567 123 441 as an example. The number of components in this case is 7, the number of numbers is 3, and the radix is 10. This suggests that radix sort would require 10 bins and 3 cycles to complete the sorting.   shows how the radix order is followed by the list. Each key is probably thrown into the garbage bin facing down. Each bin is turned into a key when the output to the is to be attached to the phrase: at the end of the bin.

Consider an Array arr= {2, 3, 4, 1, 5}, what are the pivots that are returned as a subsequent partitioning: 1 and 2 1 and 6 2 and 6 1 and 3

import java.util.Scanner;import java.util.ArrayList; public class UserIDSorting {// TODO: Write the partitioning algorithm - pick the middle element as the // pivot, compare the values using two index variables l and h (low and high), // initialized to the left and right sides of the current elements being sorted,// and determine if a swap is necessarypublic static int partition(ArrayList<String> userIDs, int i, int k) {} // TODO: Write the quicksort algorithm that recursively sorts the low and // high partitionspublic static void quicksort(ArrayList<String> userIDs, int i, int k) {} public static void main(String[] args) {Scanner scnr = new Scanner(System.in); ArrayList<String> userIDList = new ArrayList<String>(); String userID; userID = scnr.next();while (!userID.equals("-1")) {userIDList.add(userID);userID = scnr.next();}// Initial call to quicksort quicksort(userIDList, 0, userIDList.size() - 1); for (int i = 0; i < userIDList.size(); ++i)…

A hash table is an efficient data structure to store and access data via keys. In this problem, you need to find the longest subarray of distinct elements. For example, given an array A = <milk, water, 6724, water, soda, beer, apple, grape, wine>, the longest subarray is <milk, water, 6724, soda, beer, apple, grape, wine> Hint: you need to keep track and update the positions of the elements. a) Explain how many unique subarrays are there from a given array b) Describe your ideas on how to solve the problem, especially how hash tables can be used to keep track of the important information c) Write the most efficient algorithm (pseudo code) to solve this problem with complexity analysis. You can assume that a good hash function is given.

Modify the ArrayDeque implementation so that it does not require the modulus (%) operator. The modulus operator is "expensive" on some systems. Instead, the implementation should make use of the fact that if a.length is a power of 2, then k % a.length = k & (a.length - 1). Here, & is the bitwise and operator. (p 61) Open Data Structures in Java, section 2.7

Develop and implement a version of mergesort that does not rearrange the array, but returns an int[] array perm such that perm[i] is the index of the i th smallest entry in the array.

Please implement this function: void swap(int pos1, int pos2) {}. There's an answer from the previous teacher but he added '' node** hRef " in the function (see below) please correct without the href.  For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. PLEASE CORRECT THIS ONE  void swap(node** hRef, int pos1, int pos2) {    if (pos1 == pos2)        return;     node *prevNode1 = NULL;    node* currNode1 = *hRef;     while (currNode1 && currNode1->index != pos1) {        prevNode1 = currNode1;        currNode1 = currNode1->next;    }      node *prevNode2 = NULL;    node *currNode2 = *hRef;     while (currNode2 && currNode2->index != pos2) {        prevNode2 = currNode2;        currNode2 = currNode2->next;    }      if (currNode1 == NULL || currNode2 == NULL)        return;     if (prevNode1 != NULL)        prevNode1->next =…

Exercise Generate a log-log plot of your period T vs. dynamic mass ma. This is the same plot that you drew on the log-log graphing paper from your materials pack. Perform these steps: 1. Define lists or numpy arrays that contain your experimental data. For example, md = [0.10, 0,15, 0.20] defines a list of dynamic masses 0.1, 0.15 and 0.20 kg, and T = [0.75, 0.83, 0.91] defines a list of periods (in seconds). 2. Generate a log-log plot of T vs. ma that shows your data as points (not lines!) using plt.loglog() with the 'o' option. The dynamic mass should be on the horizontal (x) axis. 3. Add grid lines for both the "major" and "minor" ticks, and both axes. Look up the documentation of plt.grid() to see how this is done. Remember that you can get the documentation for any command by running it in a cell of its own and appending a question mark, e.g. plt.grid?. 4. The axis tick labels will likely show up in scientific notation (e.g. 6 × 10−²). For our values (mostly in the 0.1...1 kg…

The insertion sort was discussed and the implementation was demonstrated in the sorting lecture. In this assignment, you are asked to re-implement the insertion sort (InsertionSort.java),with additional requirements. Particularly, you need to show:1. For each iteration, how a number from a unsorted region is placed in the correctionposion in the sorted region;2. How to make the whole array be sorted based on the previous step, and count the totalnumber of shifts during the whole insertion sort process.2 Details of the ProgramTo complete the whole implementation, you should write at least the following importantmethods:2.1 Part1: insertLast/**A method to make an almost sorted array into fully sorted.@param arr: an array of integers, with all the numbers are sortedexcepted the last one@param size: the number of elements in an array*/public static void insertLast(int[] arr, int size){// your work}To make it concrete, let’s use the example shown in Figure 1. In this example, the…