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++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.6: The Standard Template Library (stl)

Problem 8E

See similar textbooks

Similar questions

Given two sorted arrays, write a function to merge them into a single sorted array. What is the time complexity of your solution?
Please help me with this: using js 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…
4. Create a vector (name the vector as "A") with random 12 values from the interval [1, 40] and use for loop to find the greatest element of the vector (name the element as maxA). Then, use while loop to find the smallest element of the vector (name the element as minA). Define a vector B, where B is the vector A sorted in descending order. Define a vector C, where C is the vector A sorted in ascending order. For the results (output) show the vectors A, B, C, maxA, and minA. [20 points]
In Matlab code 2. A fibonacci sequence is a sequence such that, beginning with the third element, each term is the sum of the two previous ones. For a particular fibonacci sequence a₁ = 3 and a₂ = 7. Use a for loop to (i) generate the first 50 terms of the sequence. Store the sequence values in a vector. (ii) generate a sequence of ratios of the successive terms. For example, the first element will be 7/3, the second element will be 10/7.
Using the srand() and rand() C++ library, generate a vector of integers. Prompt the user for the size of the list. The random integers should be scaled to the range 1 to 100 (see page 283). Sort the numbers using the sort function from the algorithm library and display the numbers. Then calculate the percent of numbers from 1 to 50 (including 50) and from 51 to 100. Report the percentages.
a. It was remarked in this chapter that the performance of bubble sort can be improved if we stop the sorting process as soon as we find that in an iteration no swapping of elements take place. Write a function that implements bubble sort algorithm using this fact. b. Using the algorithm that you designed in part (a), find the number of iterations that are needed to sort the list: 65, 14, 52, 43, 75, 25, 80, 90, 95.
Q2} Write program to find multiplication of the vector (x) with vector(y) where: X=[X1 X2 X3 X4..... Xn] X.Y=[X1. y1 + X2. Y2+ X3. y3 + X4. y4 +..... Y=[y1 y2 y3 y4.... Yn ] + Xn. Yn]
A set of data is given with the rebound height of tennis balls in centimeters from height 250cm (data.txt). Write three MatLab user-defined functions: usersort, GroupData and MeanStD. The function xo = usesort(x) should be able to sort an array in ascending order, the function [f, X] = GroupData(x) should create labels of the data and should return the labels X and the number of data for each label f and the function [A,s] = MeanStD(x) should return the mean value and the standard deviation as defined by the last equations in the slides 11 and 12. The labels X should start from the smallest round integer (use fix in MatLab) and should go until the largest round integer (use fix) with interval equal to 1. Each label should count the points that are smaller by half interval until larger by half interval. Calculate the density function of the Gauss distribution and define the following probabilities that a randomly chosen value of x will be: (i) no greater than 174cm, (ii) between 174cm…
Suppose you are given a vector x. Write first a pseudo-code or algorithm that would print out the sum of all the entries in x. You will probably want to use a some kind of for loop construction to achieve this. 1: for i = start : finish do 2: statements 3: end for Now use the start:increment:finish notation, and modify your procedure slightly, to print out the sum of the odd elements in the array (that is, the elements in entries 1, 3, 5, and so on). Implement and test your algorithm with an arbitrary array of real numbers using Python.
Write a function to find the maximum sum of a subarray within a given array of integers. The subarray should be contiguous, meaning the elements are adjacent to each other in the array. For example, given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum sum of a subarray is 6, which corresponds to the subarray [4, -1, 2, 1]. Write a function named maxSubarraySum that takes an array of integers as input and returns the maximum sum of a subarray. Note: If all the elements in the array are negative, the function should return 0. Example: Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Input: [-1, -2, -3, -4] Output: 0 Write the maxSubarraySum function that solves this problem efficiently.
Write a function max_matrix(M) that takes in a non-empty matrix (a 2-dimensional array) of real numbers M and returns its maximum value. You must use loops in your code. In python
Let A and B be two integers valued arrays of sizes n1 & n2 respectively. The elements of the two arrays are sorted in increasing order and may contain duplicate elements.It is required to form a list, C, of distinct elements, in increasing order, that are in A but not in B and in B but not in A. (There shall be no duplicate elements in list C.)The two arrays, A & B, can only be traversed once.Example:A: -2, 2, 4, 4, 4, 7, 9, 9, 9, 12, 15,B: 1, 2, 5, 9, 15, 15, 15, 17, 17, 17C: -2, 1, 4, 5, 7, 12, 17