A vector is given by x-[ 9-1.5 13.4 13.3 -2.1 4.6 1.1 5 -6.1 10 0.2). Using conditional statements and loops, write a program that rearranges the elements of x in order from the highest numeric value to the lowest numeric value. Do not use Matlab's built-in sort function. For extra credit, make an input command for vector x that accepts input from the user for a vector x to sort!

A vector is given by x-[ 9-1.5 13.4 13.3 -2.1 4.6 1.1 5 -6.1 10 0.2). Using conditional statements and loops, write a program that rearranges the elements of x in order from the highest numeric value to the lowest numeric value. Do not use Matlab's built-in sort function. For extra credit, make an input command for vector x that accepts input from the user for a vector x to sort!

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

The goal of this second exercise is to develop a better understanding of the Linuxinterprocess communication mechanisms. This would require you to write twoprograms P1 and P2. The first program P1 needs to generate an array of 50random strings (of characters) of fixed length each. P1 then sends a group offive consecutive elements of the array of strings to P2 along with the ID’s ofthe strings, where the ID is the index of the array corresponding to the string.The second program P2 needs to accept the received strings, and send backthe highest ID received back to P1 to acknowledge the strings received. Theprogram P2 simply prints the ID’s and the strings on the console. On receivingthe acknowledged packet, P1 sends the next five strings, with the string elementsstarting from the successor of the acknowledged ID. The above mechanism needs to be implemented FIFO and UNIX DOMAIN SOCKETS. Please note that you may NOT make assumptions about the reliability of the interprocess communication…
We would like to write a script that prints a vector Vi one element per line (i.e. a new line is following every element), with 2 digits following the decimal point, and 8 digits in all. Every number is followed by a comma (,) except the last. In other words every number printed (other than the last) will be followed by a comma and then a new line. Which of the below codes can do that? a.l = length(Vi); fprintf('%.82f,\n',Vi(1:l-1)); fprintf('%6.2f\n',Vi(l)); b.l = length(Vi); fprintf('%8f,\n',Vi(1:l-1)); fprintf('%.2f\n',Vi(l)); c.l = length(Vi); fprintf('%8.2f,\n',Vi(1:l)); d.l = length(Vi); fprintf('%8.2f,\n',Vi(1:l-1)); fprintf('%8.2f\n',Vi(l));
Write a procedure for encryption by rotating each plaintext byte different number of positions. For example, in the following array that represents the encryption key, each number indicates a left rotation: key BYTE 6, 4, 1, 2, 7, 5, 2, 4, 3, 6. Pass the pointer to the text string in EDX, the array size to ECX, a pointer to the key array in ESI, and the direction value (0 or 1) in EBX. Assume that the key array size is 10. Your procedure should loop through plain text and align the key to the first 10 bytes of the message. Rotate each plain text to the left (if the value in EBX is 0) or to the right (if the value in EBX is 1) by the amount in the key array: first byte by 6, second byte by 4 etc. Then align the key to the next 10 bytes until the whole message is encrypted. Write a program that tests the procedure by calling : one time with EBX = 0 (encrypting), then with EBX = 1 (decrypting). Print out the text three times: the original, then the encrypted, then the decrypted.
I need help to generate the waveform s v is a vector contains 100000 random bits of 1 or -1. Generate the digital waveform s. Let the bit period be 50 ps i.e. 20 Gbits/s. Let there be 10 samples/bit in this simulation i.e. the samples are spaced 5 ps apart andsis 10 times longer thanv. Each bit invis multiplied to 10 samples in s below is my scripts, please help import numpy as np import matplotlib.pyplot as plt import sys import random vector_Len = 10**5 v = 2*np.random.randint(low = 0, high = 2, size = vector_Len) -1 random.shuffle(v) s = v[:10] Subject: Python Programming
using matlab If the digits of π were random, then we would expect each of the integers to occur with approximately equal frequency in the decimal representation of π. In this problem we are going to see if the digits of π do indeed appear to be random. The first line of your script stores the first 100 digits of π in the vector pi_digits. Create a vector f50 such that f50(i) is equal to the frequency with which the integer i-1 appears among the first 50 digits of π. Execute the command bar(f50) to visualize the distribution of integers over the first 50 digits. Does the bar chart appear to suggest randomness? Create a vector f100 such that f100(i) is equal to the frequency with which the integer i-1 appears among the first 100 digits of π. Execute the command bar(f100) to visualize the distribution over the first 100 digits. Note that Matlab Grader will only display one plot at a time, so your earlier plot will be overwritten here. Does this bar chart appear to suggest…
Write a Python program, in a file called forest_map.py, to solve the following problem: Hansel and Gretel are abandoned in a forest with only a bag of breadcrumbs and must find their way home. The forest is laid out in a grid pattern. They can only take a step at a time through the forest, going either South or East. They cannot move diagonally, they cannot move North, and they cannot move West. As they leave a space, they will leave a breadcrumb (“*”) behind just in case -- if they have any breadcrumbs left. They do not leave a breadcrumb in the space where the path ends. If they don’t have enough breadcrumbs, they still move on to the next space, leaving their current space as it was. Given (as input) the number of breadcrumbs Hansel and Gretel have, and given the forest layout (as a fixed, but changeable, two-dimensional list in your code), determine whether Hansel and Gretel have just enough, more than enough, or not enough, breadcrumbs to leave in the path to get to the end. If…
A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE.For example: if s = {3,4,6,8}, the array looks like this: Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to…
Implement the buildDistributionArray function to take an array of scores, built by parseScores, as an argument. A grade distribution array of length 5 is returned. Loop through the scores array and tally up the number of A, B, C, D, and F scores using the standard scoring system (90 and above = A, 80‐89 = B, 70‐79 = C, etc.). Store these totals in a distribution array where the number of As is the first number, number of Bs is the second number, etc. Ex: ["45","78","98","83","86","99","59"] → [2, 2, 1, 0, 2] buildDistributionArray returns [0, 0, 0, 0, 0] when the scoresArray argument is empty.
Write a Java program called E2b that will read from StdIn an integer, n, and will set the size of a 2D array to have n rows and n columns. The values in this n x n 2D array must be read from StdIn and the array must be filled in row-major order. For example, if the following input stream was read: 4 1 2 3 4 4 3 2 1 9 8 7 6 5 7 6 4 The 2D array created would be: 1 2 3 4 4 3 2 1 9 8 7 6 5 7 6 4 Include in the program above, code that would print the values in the 2D array beginning with the value in the last row, last column and ending with the value in the 0th row, 0th column, traversing the columns from bottom to top, printing n values in each row of the output. The values in the array do not change. You are simply printing them in a unique order.
Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and prints an m-by-n grid of cells with k mines, using asterisks for mines and integers for the neighboring mine counts (with two space characters between each cell). To do so, Generate an m-by-n grid of cells, with exactly k of the mn cells containing mines, uniformly at random. For each cell not containing a mine, count the number of neighboring mines (above, below, left, right, or diagonal)
Create a TST client with a static method that computes the L-similarity of two documents by taking two file names and an int value L as command-line arguments. The L-similarity is the Euclidean distance between the frequency vectors, which is determined by the number of instances of each trigram divided by the total number of trigrams. Include a static function main() that outputs a matrix displaying the L-similarity of all pairs of documents and accepts an int value L as a command-line parameter along with a list of file names from standard input.
Write a TST client with a static method that takes an intvalue L and two file names as command-line arguments and computes the L-similarityof the two documents: the Euclidean distance between the frequency vectors defined bythe number of occurrences of each trigram divided by the number of trigrams. Includea static method main() that takes an int value L as command-line argument and a listof file names from standard input and prints a matrix showing the L-similarity of allpairs of documents.