Problem: Given 20 positive integers as input, calculate the number of divisors for each integer and sort the data set fromsmallest to largest based on the number of divisors. When multiple integers have the same number of divisors then sortthem smallest to largest.Examples: Integer value 12 has divisors 1, 2, 3, 4, 6, 12 for a total of 6. Prime numbers only have divisors of 1 and thenumber itself. The integer 1, the smallest value that will be provided as input, has only a single divisor, itself.Example Execution #1:Enter 20 integer values -> 21 15 10 6 3 1 28 13 5 7 9 29 31 37 17 19 12 43 24 2Data sorted by number of divisors: 1 2 3 5 7 13 17 19 29 31 37 43 9 6 10 15 21 12 28 24Example Execution #2 (data does not have to be unique):Enter 20 integer values -> 9 7 5 3 8 6 4 2 9 75 3 8 6 4 2 9 7 5 3Data sorted by number of divisors: 2 2 3 33 5 5 5 7 7 7 4 4 9 9 9 6 6 8 8 Additional Requirements:1. Add the homework assignment header file to the top of your program. A description of your program will need tobe included in the assignment header. This particular header can be added to your file by entering hhw while incommand mode in vi.2. Each of the example executions provided for your reference represents a single execution of the program.Your program must accept input and produce output exactly as demonstrated in the example executions. Yourprogram will be tested with the data seen in the example executions and an unknown number of additional testsmaking use of reasonable data.All data input will be of the int data type and non-negative. There is no input validation requirement.3. For this assignment you will be required to implement the user-defined functions (from chapter 4). Failing tofollow course standards as they relate to good user-defined function use will result in a zero for this assignment.4. Revisit course standards as it relates what makes for good use of user-defined functions, what is acceptableto retain in the main function, and when passing parameters by address is appropriate.In many cases user-defined function use should result in a main function that only declares variables andmakes function calls.5. Course standards prohibit the use of programming concepts not yet introduced in lecture. For this assignmentyou can consider all material in the first eight chapters of the book, notes, and lectures to be acceptable for use.The use of any dynamic array structures (chapters 9 and 10) would violate this requirement and result in nocredit being awarded for your effort. See course standards that follow for array declaration expectations.6. A program MUST compile to be considered for partial credit. The submission script will reject the submission ofany file that does not successfully compile on the guru server. The name of the source code file you attempt tosubmit must be hw06.c, no variation is permitted.

Below is the code in c++ as language not specified and output:

Problem: Given 20 positive integers as input, calculate the number of divisors for each integer and sort the data set from smallest to largest based on the number of divisors. When multiple integers have the same number of divisors then sort them smallest to largest. Examples: Integer value 12 has divisors 1, 2, 3, 4, 6, 12 for a total of 6. Prime numbers only have divisors of 1 and the number itself. The integer 1, the smallest value that will be provided as input, has only a single divisor, itself. Example Execution #1: Enter 20 integer values -> 21 15 10 6 3 1 28 13 5 7 9 29 31 37 17 19 12 43 24 2 Data sorted by number of divisors: 1 2 3 5 7 13 17 19 29 31 37 43 9 6 10 15 21 12 28 24 Example Execution #2 (data does not have to be unique): Enter 20 integer values -> 9 7 5 3 8 6 4 2 9 7 5 3 8 6 4 2 9 7 5 3 Data sorted by number of divisors: 2 2 3 3 3 5 5 57 7 7 4 4 9 9 9 6 6 8 8

Problem: Given 20 positive integers as input, calculate the number of divisors for each integer and sort the data set from smallest to largest based on the number of divisors. When multiple integers have the same number of divisors then sort them smallest to largest. Examples: Integer value 12 has divisors 1, 2, 3, 4, 6, 12 for a total of 6. Prime numbers only have divisors of 1 and the number itself. The integer 1, the smallest value that will be provided as input, has only a single divisor, itself. Example Execution #1: Enter 20 integer values -> 21 15 10 6 3 1 28 13 5 7 9 29 31 37 17 19 12 43 24 2 Data sorted by number of divisors: 1 2 3 5 7 13 17 19 29 31 37 43 9 6 10 15 21 12 28 24 Example Execution #2 (data does not have to be unique): Enter 20 integer values -> 9 7 5 3 8 6 4 2 9 7 5 3 8 6 4 2 9 7 5 3 Data sorted by number of divisors: 2 2 3 3 3 5 5 57 7 7 4 4 9 9 9 6 6 8 8

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

Question 17 Aa .You are given a sorted list of n numbers stored in an array A, where n can be arbitrarily large. Now randomly generate a number k and search the number in the list (i.e., in A). Now randomly select two subarrays of A, each of size n^1/2 . Then repeat the same procedure on each of the subarrays. The procedure stops after the subarray sizes become 1. Analyze the time complexity of finding the total number of successful searches in the entire procedure using big O-notation Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. Solution should avoid Runtime Error
You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.
a. Write down the algorithm for linear search.b. Write a program that uses a linear search to search for the 5th value using c++.c. Discuss 2 advantages of using linear search over binary search.d. Discuss 2 advantages of using binary search over linear search.e. Write down the algorithm for binary search.f. Using binary search, write a program in c++ that will search though any given nth numberof values in an array.
in C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I CAN UNDERSTAND EVERY STEP PLEASE, A C program can represent a real polynomial p(X) of degree n as an array of the real coefficients al, al, ..., an (an ‡ 0). p(X) = a0 + a1X + a2 X2 + . . .+ anXn Write a program that inputs a polynomial of maximum degree 8 and then evaluates the polynomial at various values of x. Include a function get_poly that fills the array of coefficients and sets the degree of the polynomial, and a function eval_poly that evaluates a polynomial at a given value of x. Use these function prototypes: void get_poly ( double coeffIl, int* degreep); double eval_poly( const double coeffIl, int degree, double x);
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…
Transcribed Image Text Q} Code the given problem using python programming language Sereja has an array consisting of n integers a1 < a2 <... < an. Based on this array, he has to answer m queries represented by pairs integers t and d. The answer for a query is the smallest integer i for which there exist some k ( i < k) such that a; + d > a;+1, a; +1 + d2 a;+2, ..., ar – 1 + d> ak, ak <t and ar+1 > t (if it exists).
Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.
Using C programming language. Solve this question using votes of N parties(use array) , read 3 lines of input of data with from the monitor that is given with the following structure. Number of parties Name of city, Number of parliaments Votes of each parties Example of data will be as follows. 6 GIRNE 9 3000 6020 8010 1250 1800 3755 MAGUSA 12 3800 6090 1350 4079 8099 2450 LEFKOSA 16 …… .. EOF(CTL+Z) To find the greatest value in an array will be determined in a function named findGreatest(..) Program will generate the following output.outputs. A)Display distribution of parliaments of each parties for each record of the city. B)Display distribution of parliaments of each parties for TRNC(KKTC).
def find_root4(x, epsilon): ''' IN PYTHON Assume: x, epsilon are floating point numbers and epsilon > 0 Use bisection search to find the following root of x such that If x >=0, return y such that x - epsilon <= y ** 2 <= x + epsilon Else, return y such that x - epsilon <= y ** 7 <= x + epsilon Note: You must use bisection search to implement the function. ''' pass
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.
Sort the following functions in increasing order of growth following the Big-O notation (NB: There is no need typing the functions, just use the labels (a) to (h) to sort the functions accordingly.) a. log log log(n) b. n3 log(n) c. 4.5(n) d. 3(n) e. n(4) log(n) f. log log(n) g. 4.5n + log(n) h. 3(500)