Write a program that obtains the execution time of four different sort functions (Insertion, Bubble, Merge, and Quick). Ask the user how many integers they would like sorted. After each sort is complete print out the number of integers sorted and the execution time of each sort. Execution time can be generated using the following code: long startTime - System.nanotime(); perform the sort; long endTime - System.nanotime(): long executionTime - endTime-startTime;

You have made a device that automatically measures both distance from a magnet and the magnetic field strength at that distance. The device sends the pair of data to your computer as a pair of real numbers. However, the device moves back and forth as it takes data, so neither the field measurement nor the distance measurement arrives in ascending or descending order. Write a code vector_sort that receives a two-dimensional array of numbers and sorts them based on either the first column or the second column (this must be an input to the function. The function must also either sort high-to-low or low-to-high, based on an input value. Write a main function that can read up to twenty pairs of data. The main function must also input whether you want to sort high-to-low or low-to high. It must also input whether you want to sort on magnetic field or distance. Finally the code must print the pair data as originally entered and then, after calling vector_sort, the ordered pair data. C Program

Give me correct code. Downvote for incorrect and copied code. Changes in function..

In this problem, you have available to you a working version of the function round_up described in part (a). It is located in a module named foo. Using the given round_up function, write a function round_up_all that takes a list of integers and MODIFIES the list so that each number is replaced by the result of calling round_up_ on that number. For example, if you run the code,  1st = [43, 137, 99, 501, 300, 275] round_up_all(1st) print(1st) the list would contain the values [100, 200, 100, 600, 300, 300] Do not re-implement the round_up function, just import the food module and use it.  Here is the code for the round_up function that can be imported using foo: def round_up(num):    if num % 100 == 0 :  #if number is complete divisible        return num  #return orginal num    else:        return num + (100-(num % 100))  #else add 100-remainder to num,  if __name__ == '__main__':    print(round_up(234))    print(round_up(465))    print(round_up(400))    print(round_up(89))

Using Python This assignment is about temperatures and requires the main function and a custom value-returning function. The value-returning function takes a list of random Fahrenheit temperatures as its only argument and returns a smaller list of temperatures that are below freezing.  The main function needs these steps in this sequence: create an empty list that will the hold Fahrenheit temperatures. use a loop to add 25 random integertemperatures to the list. All temperatures should be between 5 and 75, inclusive. use another loop to display all 25 temperatures on one line separated by spaces. report the highest and lowest temperatures in the list. 32 might be in the list. Report the index of the first instance of 32 or report that it didn't make the list. using slice syntax: print the first 10 temperatures in the list. print the middle 5 temperatures in the list. print the final 10 temperatures in the list. execute the custom value-returning function with the complete list as…

Java - Normalizing

Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6   Function Name: winInDiagonalBSParameters: board: 2D integer array, piece: integerReturn: booleanAssume board is valid 2D int array, piece is X==1/O==2.Look at all backward slash \ diagonal in the board. If any backward slash \ diagonal has atleast 3 consecutive entries with a given type of piece (X/O) (3 in a row XXX, OOO), then return true,otherwise false.

Write a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like:   int Search (floats a[ ], int n, float number);   Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns  –1 If the number to be searched is 9.8,the function returns  2   C++ language only.

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below.             The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std;   // Global constants const int ROWS = 3;  // The number of rows in the array const int COLS = 3;  // The number of columns in the array const int MIN = 1;  // The value of the smallest number const int MAX = 9;  // The value of the largest number //…