Assume nums is an array of doubles, and that we want to perform a bubble sort on the array. In one line of code, please define the temp variable for that algorithm [d1] Now assume names is a vector of strings, and that we want to perform a bubble sort on the vector. In one line of code, please define the temp variable for that algorithm. [d2]

Assume nums is an array of doubles, and that we want to perform a bubble sort on the array. In one line of code, please define the temp variable for that algorithm [d1] Now assume names is a vector of strings, and that we want to perform a bubble sort on the vector. In one line of code, please define the temp variable for that algorithm. [d2]

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

For this problem, you will need to sort a list of whitespace separated integers using three different sort algorithms. Your program read in a sequence of space-character separated integers, and it will output the state of the initial list of numbers and also the vector after each swap for each of the three sorting algorithms (selection, insertion, and bubble). Sorting will be a big part of CSE 331, this question is to give you a taste of that early.
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…
Consider a Binary Search Algorithm that performs a search for the number 48 within the following unsorted list. Using paper and pencil, show the detailed steps for that search algorithm until 48 is found. You must use bubble sort if need it.1019134353415604870
1. Consider a problem of computing the prefix average of a sequence of numbers stored in an array P consisting of P integers. We want to compute an array P such that P is the average of P for P . Consider the two algorithms related to the above problem. Answer the questions given below
Program in C. Write a function that receives a vector of integers already sorted in ascending order, an integer n representing the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if it is the searched one, it returns the number of tests done so far, if it is not the searched one, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". int bin_search(int array[], int n, int b){//code}
Suppose we are performing a binary search on a sorted vector initialized as follows: // index 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 vector<int> numbers{ 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34}; int index = binarySearch(numbers, 28); Write the indexes of the elements that would be examined by the binary search (the mid values in our algorithm's code) and write the value that would be returned from the search. NOTE: When writing the indexes (mid values), separate them by comma followed by spaced. Example: 7, 3, 5 find: indexes examined value returned
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.
Write a function that receives a vector of integers already sorted in ascending order, an integer n representing the number of elements in this vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The binary search works as follows: you must look for the element in the position exactly in the half of the vector, if it is the one searched for it returns the number of tests done so far, if it is not the searched one, calculate the midpoint of the half of the vector after assess whether the searched value is greater or less than the value at the middle position. Not finding the value searched, the function must return 0. The name of the function will be called "busca_bin". Program in C.
Write pseudocode of an insertion sort algorithm. Illustrate the execution of the algorithm on the array X = {2, 11, 98, 23, 48, 33, 97, 61, 3}, writing the intermediate values of X at each iteration of the algorithm. Please and thank you
In this assignment you will compare the real-time performance of the built-in sort function in the STL and your implementation of the bubble sort algorithm. First, generate an array of 1000 random numbers from 1 to 10000. Sort the array with your bubble sort function and time the sort. Then generate a new set of 1000 numbers and sort using the STL sort function, timing its performance. What are the differences in times to sort? Now increase the array size to 10000 and time both sorts. What are the differences? Now increase the array size to 100000, sort both ways, and compare. At what point did the two algorithms begin to diverge in time to sort? If they hadn't diverged by 100000 elements, continue increasing the size of the array until the two sorts do diverge and report on the size of the array and compare the sorting times. // C++ Please!!!
Given a string representing an array of strings, you will need to sort the given array with the following rules: • Strings should first be sorted based on their rate of occurrence, i.e. strings that are more frequent should appear earlier in the list • If two strings are tied in their occurrence, then they should be sorted by their alphabetical order Each string will be contained by single-quotations which are not part of the word. Additionally, all words will be lower-case. Spelling does NOT matter, nor do the words have to be "valid" or real words. Input will be given exactly as it appears, including brackets, quotations, spaces, and commas, all on a single line of input (I have spread them over many lines to aid reading, they are all on one line). Your output should consist of the words in their proper order followed by their frequency, as below. Feel free to use any methods we have learned in class to answer this, along with the vector or list STL and string…
Write an ALP to execute the following: a) Largest number in a given array b) Smallest number in a given array C) Sort in ascending order d) Sort in descending order