Transform the algorithm into a program to sort elements in an array, giving the name of the sorting algorithm used and ensuring that the program works. Run the program using 10 as the number of marks record, showing clearly your c program code and print your output. Task 21. An English Inguage teacher recordod the scores of a test which he sorted (i.c. in ascending or desccnding order). Heknows thut you are a Computer Science studont so he asks you to use the sorting algorithm (giren in pseudocode)below to lielp him.order his marks.Start :n, table(10001, c, d, t; integersEnter the number of elementsto be sortednEnter n integersLor c- 0 to oless than n doread the tableendforfor c = 1 to c less than n-1 dowihile d is different irce 0 and table[d] isless than table(d-1) dot = table[d] ;table(d] = table(d-1]itable(d-1) = t;decrease d;/*cutput a list Sorted in ascending order/for c = 0 to c less than orequal to nendforprint (table[c)|return 0;end

Task 2 1. An English Ianguage teacher rocorded the scores of a test which he sorted (i.e. in ascending or descending order). He knows that you are a Computor Science studont so he asks you to use dhe sorting algorithm (givea in pseudocode) below to lielp him.order his marks. Start: n, table(10001, c, d, t; integers Enter the number of elements to be sorted n Enter n integers Lor c - 0 to c less than л do read the table endfor for c = 1 to c less than n-1 do while d is different frce 0 and table[d] ie less than table(d-1) do t = table(d]; tableld] = tableld-1]: table(d-1) = t; decrease d; /"cutput a list Sorted in ascending order/ for c = 0 to c less than or equal to n endfor print (table[c)1 return 0; end

Task 2 1. An English Ianguage teacher rocorded the scores of a test which he sorted (i.e. in ascending or descending order). He knows that you are a Computor Science studont so he asks you to use dhe sorting algorithm (givea in pseudocode) below to lielp him.order his marks. Start: n, table(10001, c, d, t; integers Enter the number of elements to be sorted n Enter n integers Lor c - 0 to c less than л do read the table endfor for c = 1 to c less than n-1 do while d is different frce 0 and table[d] ie less than table(d-1) do t = table(d]; tableld] = tableld-1]: table(d-1) = t; decrease d; /"cutput a list Sorted in ascending order/ for c = 0 to c less than or equal to n endfor print (table[c)1 return 0; end

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

Let A={1,2,3...,10}. How many subsets B of A where B = │4│and the smallest element in B is 4? Write a computer program or develop an algorithm that lists all subsets according to the part (a). (Please display the all subsets).
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.
Exercise 1: Write a program that generates a sequence of 20 random values between 0 and 99 in an array, prints the sequence, sorts it, and prints the sorted sequence. Use the sort method from the standard Java library. Exercise 2: Write a program that stores a list of countries: "Egypt", "Switzerland", "Argentina", "Spain", "Portugal", "Luxemburg", etc. Initialize your array with a single statement. Then print out the array. Use the sort function as before to sort the countries in alphabetical order. Reprint your array. Exercise 3: Implement exercises 1 and 2 using ArrayList. Use the Collections.sort method for sorting. After you have printed and sorted your results, then append an additional element to each list and reprint your ArrayLists. Notice that the new items will appear just at the end and will not be sorted. Resort and print out the new ArrayLists again. To clarify, you should print out your ArrayLists after your first sort, after adding items with the…
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science. Ridbit begins with an integer n. In one action, he can perform one of the accompanying tasks: partition n by one of its appropriate divisors, or take away 1 from n in case n is more prominent than 1. An appropriate divisor is a divisor of a number, barring itself. For instance, 1, 2, 4, 5, and 10 are appropriate divisors of 20, however 20 itself isn't. What is the base number of moves Ridbit is needed to make to decrease n to 1? Input The principal line contains a solitary integer t (1≤t≤1000) — the number of experiments. The main line of each experiment contains a solitary integer n (1≤n≤109). Output For each experiment, output the base number of moves needed to lessen n to 1.
WRITE THE MAIN.CPP FOR THIS PROGRAM a. Write a version of the sequential search algorithm that can be used to search a sorted list. (1, 2) b. Consider the following list: 2, 20, 38, 41, 49, 56, 62, 70, 88, 95, 100, 135, 145 Using a sequential search on ordered lists, that you designed in (a), how many comparisons are required to determine whether the following items are in the list? (Recall that comparisons mean item comparisons, not index comparisons.) (1, 2) 2 57 88 70 135 Write a program to test the function you designed. Note: Have the function,seqOrdSearch, return -1 if the item is not found in the list. (return the index of the item if found).
Q1)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. Q2)Consider an array consisting of the following sequence: 1, 4, 9, 16, 25, 49, …, n Suppose a number in the sequence is missing. Write the mathematical process to find the missing number, i.e. some equation. What is the time complexity of finding the missing number in the sequence? Q3)Sort the text “SARHAD UNIVERSITY” in ascending order using the insertion sort algorithm. Discuss also the best, worst and average case complexity of the…
Exams.cpp) Suppose a teacher weights the fourexams he gives 10%, 25%, 30%, and 35%. Write a programthat reads ten sets of four grades, prints the weightedaverage of each set, and prints the unweighted average ofeach test. The number of students should be in a globalconstant.
Q1: 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.
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.
Consider the 2D array “list”. Each row represent a class say Bangla or English or Math, andthe columns indicates student. A ‘1’ in list[c][s] indicates student s is in class c; a ‘0’ meansstudent s is not in class c. Write a program to display the class number (0/1/2) with the mostnumber of students.
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?
define two lists of numbers (arrays) and ask the user to give the size of each, and then ask the user to fill the list(according to a size that he gave), then compare two arrays and determine whether they are equal? (Note: two arrays are equal if all elements are equal.)