Suppose you are given an array A of n Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.

Suppose you are given an array A of n Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 15PE

See similar textbooks

Similar questions

Q: Suppose you are given an array A of n elements. Your task is to sort n numbers stored in array A by reading the first element of A and placing it on its original position (position after sorting). Then read the second element of A, and place it on its original position. Continue in this manner for the first n-1 elements of A. What type of sorting is this? Write the algorithm and also mention the name of this sorting algorithm. What loop invariant does this algorithm maintain? Give the best-case and worst-case running times of this sorting algorithm.
Given the following array of numbers: 8 2 3 9 10 1 4 6 7 5 Show what the array looks like after each iteration of the following sorting algorithms: Bubble Selection Insertion Mergesort Only show the array contents with each algorithm. You do not need to show function call instances if recursion is used or write any code. Just show the array at key iterations of the algorithm. You can use your own words to describe them as well for more detail (but do not write any code). Show what the array looks like after each recursive iteration of the Quicksort algorithm.
1. Write a program that compares all four advanced sorting algorithms discussed in this chapter. To perform the tests, create a randomly generatedarray of 1,000 elements. What is the ranking of the algorithms? What happens when you increase the array size to 10,000 elements and then 100,000elements?
JAVAUse array {"shall", "not", "perish", "from", "the", "earth"} to simulate selection sort. For each iteration, write down the value of initial value and index, the minimum value and its index, and then write down the array after each iteration.
create an array of 30 random numbers that range between 1and 100. And yet again, write a function that will receive a number from the userand determine if that number exists in the array or not. But this time, start bySORTING your input list. After a sort, the list in problem 1 is as follows:[2, 2, 3, 5, 12, 14, 14, 15, 23, 36, 39, 41, 44, 44, 45, 48,49, 50, 52, 52, 59, 71, 81, 82, 88, 89, 89, 93, 96, 97] Approach: Implement a method called findC(x, A, i, j), where x is the number we arelooking for in array A, the first index of the array is i and the last index is j. We wantto determine whether x exists in A anywhere between index i and index j. Your firstcall to this method will therefore look like this: findC(x, A, 0, A.length-1). In the body of your function, compare x with the item that is in the middle of thearray, as you did before. As before, call the middle of index of the array mid. But thistime, if x<=a[mid], recursively call your function to search ONLY the first half of…
Easy C++ program please answer fast Maximum Subarray Sum Rabbit Jerry downloads the list of N (2 ≤ N ≤ 105 ) stock prices of RABJ and stores them into a circular buffer/array in a clockwise manner (i.e., the first stock price follows the N-th stock price on the circular buffer) starting from index position 0. It is worth pointing out that the stock prices can be negative numbers in the rabbit stock market. He is curious about the maximum subarray sum over this circular buffer. Certainly, the maximum subarray can possibly straddle over both index positions 0 and N-1. Output the maximum subarray sum. The maximum subarray must contain at least one element. INPUT FORMAT (input arrives from the terminal / stdin): First line contains N. The next line contains N space-separated integers denoting the input sequence. The price ranges from -1,000,000 to 1,000,000. OUTPUT FORMAT (print output to the terminal / stdout): A single line containing the maximum subarray sum. Note that the output can…
7) Implement counting sort over a list of keys that lie within the range (a, b),where a and b are small positive integers input by the user.8) Implement bucket sort with an array of lists data structure to sort i) a list ofstrings, ii) a list of floating point numbers and iii) a list of integers, which areuniformly distributed over a range, for an appropriate choice of the number ofbuckets.
Help me please No programming required 1. Elementary sorts a) Sort the sequence I, L, O, V, E, A, L, G, O, R, I, T, H, M, S using the following sort methods. Show the trace after each iteration of the outer loop. Also, compare the best, worst, and average case scenarios for these algorithms. a. Insertion sort b. Selection sort c. Bubble sort b) Show in the style of the example discussed in class, how shell sorts the array E, A, S, Y, S, H, E, L, L, S, O, R, T, Q, U, E, S, T, I, O, N
Double trouble def double_trouble(items, n): Suppose, if just for the sake of argument, that the following operation is repeated n times for the given list of items: remove the first element, and append that same element twice to the end of items. Which one of the items would be removed and copied in the last operation performed? Sure, this problem could be finger-quotes “solved” by actually performing that operation n times, but the point of this exercise is to come up with an analytical solution to compute the result much faster than actually going through that whole rigmarole. To gently nudge you towards thinking in symbolic and analytical solutions, the automated tester is designed so that anybody trying to brute force their way through this problem by performing all n operations one by one for real will run out of time and memory long before receiving the answer, as will the entire universe. To come up with this analytical solution, tabulate some small cases (you can implement the…
Language: C++ Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting, it selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list.Explain your Outputs or Answers for the following: (A) Analyze your algorithm, and give the results using order notation. (B) Give a list of n items (for example, an array of 10 integers) representing a scenario. (C) Give a list of n items (for example, an array of 10 integers) representing the worst-case scenario. (D) Give a list of n items (for example, an array of 10 integers) representing the best-case scenario. Please compile your answers in a file including all source code with comments, Explain your running Outputs or Answers in (A) ~(D). Examples of a quick sort from class slides is attached.
Write the state of the elements of the vector below after each of the first 4 passes of the outermost loop of the insertion sort algorithm. (After the first pass, 2 elements should be sorted. After the second pass, 3 elements should be sorted. And so on.) // index 0 1 2 3 4 5 6 7 vector<int> numbers{29, 17, 3, 94, 46, 8, -4, 12}; insertionSort(numbers); NOTE: Write your answer inside curly braces with numbers separated by commas {29, 17, 3, 94, 46, 8, -4, 12} after pass 1 after pass 2 after pass 3 after pass 4
Given a list of scores and a passing score, you are asked to find out the numberof scores which are equal to or higher than the passing score, the lowest score, andthe highest score. For examples, if the list of scores is as follows: 46, 58, 55, 43,89, 93, 77, 82, 99, 64; and if the passing score is 60, then the answers should be 6,43 and 99. Implement the above task using MIPS. Initialize the array of scores inmemory using any integer values between 0 and 100. The passing score should beobtained from user’s input and the answer must be printed out.