Algorithm #2 - Vector Sum Objective: compute the sum of integers 0..N-1 sum = 0 A = list(range(0,N)) for i in range(0,N): sum += A[i] print("sum = ", sum) Algorithm #3 - Indirect Sum Objective: compute the sum of N integers sum = 0 # set accumulator to 0 A = list(range(0,N)) # create an array of length N filled with values 0..N-1 B = [random.randint(0,N-1) for j in A ] # create an array of length N filled with random #s indx = B[0] for i in range(0,N): sum += A[indx] indx = B[indx] print("sum=", sum)

Algorithm #2 - Vector Sum Objective: compute the sum of integers 0..N-1 sum = 0 A = list(range(0,N)) for i in range(0,N): sum += A[i] print("sum = ", sum) Algorithm #3 - Indirect Sum Objective: compute the sum of N integers sum = 0 # set accumulator to 0 A = list(range(0,N)) # create an array of length N filled with values 0..N-1 B = [random.randint(0,N-1) for j in A ] # create an array of length N filled with random #s indx = B[0] for i in range(0,N): sum += A[indx] indx = B[indx] print("sum=", sum)

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 1TF

See similar textbooks

Similar questions

slecetion sort (python) Selection sort is a sorting algorithm, like Bubble sort which you saw in the previous module. Selection sort works as follows: Selection sort divides the input list into two parts: a sublist of sorted items (left part) and a sublist of still unsorted items (right part). Initially, the sorted sublist is empty and the whole input consists of the unsorted sublist. To fill the sorted sublist, the algorithm computes the (index of) the minimum of the unsorted sublist and swaps the first unsorted element and the minimum element (if the minimum is already the first element, nothing happens). Afterward, the sorted sublist is one bigger. This continues until the unsorted sublist is empty and the entire input is sorted. Example: Sorted sublist Unsorted sublist Least element in unsorted list () (11, 25, 12, 22, 64) 11 (11) (25, 12, 22, 64) 12 (11, 12) (25, 22, 64) 22 (11, 12, 22) (25, 64) 25 (11, 12, 22, 25) (64) 64 (11, 12, 22, 25, 64) () Implement this…
Please use python codes and don't copy from previous answers. 3.) Consider the matrix list x = [[1, 2, 3], [4, 5, 6], [7, 8, 9]]. Write a list comprehension to extract the last column of the matrix [3, 6, 9]. Write another list comprehension to create a vector of twice the square of the middle column [8, 50, 128].
Implement the following two sorting algorithms in a program called p3.py. Write two separate functions for these algorithms. Both functions must take a list of integers as the input parameter.1) Bogosort: first shuffle the list argument (i.e., randomize the positions of every element) and then check to see if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.2) Bozosort: choose two elements in the list at random, swap them, and then check if the result is in sorted order. If it is, the algorithm terminates successfully and returns True, but if it is not then the process must be repeated.Write a main() function and call both sorting functions using the same list as their arguments. The list can be of any size (try a small list first). Does any of your algorithms terminate? If yes, count the number of iterations it uses to sort the list. Does it always use the same number of repetitions? If…
35. A particular sorting algorithm takes integer list 10, 6, 8 and incorrectly sorts the list to 6, 10, 8. What is true about the algorithm's correctness for sorting an arbitrary list of three integers? A.The algorithm is correct. B.The algorithm is incorrect. C.The algorithm's correctness is unknown. D.The algorithm only works for 10, 6, 8.
1. ax + b = 0, y = aeˣ! a,b ≠ 0a,b are constants number entered by the user. Find (x,y) and determine the quadrant of thecartesian plane. Print (x,y) and write which quadrant (I,II,III or IV). (PYTHON) 2. Write a program that sorts a list in ascending order. Don’t use sort method.Ask user number of list elements (at least 10 elements)Enter all elements from keyboard and printed.Sort your list. (PYTHON)
Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list
Plerase solve with inb 10 min!! I will rate you good for sure!! Please solve in Python Write a function that takes two lists: a list of states (as strings) and a list of corresponding nicknames (also as strings). Your function should return a list of tuples, where each tuple contains the state as its first element, and the corresponding nickname as its second element, in the same order as the inputs. Return an empty list if no nicknames are provided. Note: You can assume that the states list is at most as long as the nicknames list. If there are not enough states to make a tuple you should use 'NO STATE PROVIDED' as a placeholder of the state value. (See the doctests for more examples.) """>>> combine(['NV', 'CA', 'HI'], ['Silver State', 'Golden State', 'Aloha State'])[('NV', 'Silver State'), ('CA', 'Golden State'), ('HI', 'Aloha State')] >>> combine(['NV', 'CA'], ['Silver State', 'Golden State', 'Aloha State'])[('NV', 'Silver State'), ('CA', 'Golden State'), ('NO…
Bubble Sort adaptation. Rewrite the following bubblesort algorithm so that in each pass, it “bubbles down” the smallest element to the left end. /*Bubble sort given list into ascending order Input: list a[0...n-1], n: the length of list a Output: list a is rearranged into ascending order BubbleSort (a, n) { //right points to the last element of the "remaining list" //it starts from n-1, after each pass, it decreases by 1 for right=n-1 downto 1: //perform one bubbling pass, bubbling up the largest element to right end for i=0 to right-1: if (a[i]>a[i+1]): swap (a[i], a[i+1]) } Trace the execution of your adapted bubble sort (in Q3) on the following input. Minimally, draw the content of list a after each iteration of the outer-loop. a=[5,3,10,4,2,1] n=6
#include <bits/stdc++.h> using namespace std; // Function to return a vector that contains // all the generated letter combinations vector<string> letterCombinationsUtil(const int number[],int n,const string table[]) { // To store the generated letter combinations vector<string> list; queue<string> q; q.push(""); while (!q.empty()) { string s = q.front(); q.pop(); // If complete word is generated // push it in the list if (s.length() == n) { list.push_back(s); } else { // Try all possible letters for current digit // in number[] for (autoletter : table[number[s.length()]]) { q.push(s + letter); } } } // Return the generated list return list; } // Function that creates the mapping and // calls letterCombinationsUtil void letterCombinations(const int number[], int n) { // table[i] stores all characters that // corresponds to ith digit in phone string table[10] = { "0", "1", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz" };…
1. Rewrite the Bubble sort to use recursion. 2. Use the time(0) function to determine how many seconds it takes to sort a vector using the recursive method. 3. Use the time(0) function to determine how many seconds it takes to sort a vector using the non-recursive method described in the videos. Run the sort test on vectors containing random integers. You should sort vectors of the following sizes: 100 elements, 1000 elements, 5,000 elements, 10,000 elements and 50,000 elements. Was the recursive method able to work on vectors of each of those sizes? If not, explain why it errored.
1. Rewrite the Bubble sort to use recursion. 2. Use the time(0) function to determine how many seconds it takes to sort a vector using the recursive method. 3. Use the time(0) function to determine how many seconds it takes to sort a vector using the non-recursive method described in the videos. Run the sort test on vectors containing random integers. You should sort vectors of the following sizes: 100 elements, 1000 elements, 5,000 elements, 10,000 elements and 50,000 elements. Was the recursive method able to work on vectors of each of those sizes? If not, explain why it errored. 4. Create a class that will store a vector of planets (See the Planet assignment). Your class will have functions to add a planet, delete a planet and sort the planets. The class must utilize the insertion sort.
Implement bubble sort, selection sort iteratively, and recursively. Implement linear search. Familiarize with C++ STL class vector Program Execution: The following example illustrates how your program should work. The program first reads the length of the vector (as 5 in example below), then reads this number of integers, and push them into a vector. The program then reads a command (selection, bubble, rselection, rbubble), and call the corresponding sorting function to sort the vector. The vector after being sorted will be displayed. Note that the user input are underscored. [storm:]$ g++ lab1.cpp -o lab1.exe [ storm:]$ ./lab1.exe 5 74 25 32 99 24 selection 24 25 32 74 99 [storm:]$ ./lab1.exe 317 5 23bubble 5 17 23 General Hints:* Write your main function first. * Incrementally write one function and test it before moving to the next. Please refer to the slides on how to implement these functions. 1. selection: iterative selection sort function bubble: iterative bubble…