Let A = [5,5,5,5,5,...,5] be an array where all of the elements are equal to 5. Determine whether Selection Sort or Insertion Sort sorts this array faster.

Suppose that we would like to use counting sort to sort the following list of numbers . What is the initial C array constructed (not the accumulated)? The last element in array C is 1, fill the following blanks for the first 5 elements starting from the first blank. Insert digits and no decimal points.

Kim Gigabit purchases items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package sortascending; public class Sortascending { public static void sortAsc( int[] arrayToSort ) { // Find the integer that should go in each cell j of // the arrayToSort, from cell 0 to the end for ( int j=0; j<arrayToSort.length-1; j++ )...

operation of insertion-sort on the array A= {31,41,59,26,41,58}

Define Selection Sort and Bubble Sort algorithms. How would you sort the following array using selection and bubble sort algorithms. What is the time complexity of each algorithms? a=[4, 2, 6, 5]

Subject - Design and Algorithms Use Radix Sort algorithm to sort the array A = [765, 984, 109, 349, 653, 139, 810, 451, 690, 371].(Note: You must perform the Radix Sort algorithm step-by-step and show your clearly please)

Let A be an array, where each of the n elements is a randomly chosen digit between 0 and 9. For example, if n = 12, this array could be A = [3,5,1,0,5,7,9,2,2,8,8,6]. Determine whether Counting Sort or Merge Sort sorts this array faster.

Write an algorithim DELETE(A,N,POS) to delete an element at POS. You can use the following array to implement your algorithim {3,8,12,5,6} This can be pseudocode

Write an array that matches the following requirement, and provide explanation of how you got your answer.--> Using a insertion sort on the array compared to using a selection sort requires FEWER comparisons of elements.