by using c++ . We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Recall the following formula for distance between two points p and q. Euclidean distance d( p , q ) = sqrt[(qx − px)^2 + (qy − py)^2] The Brute force solution is O(n^2), compute the distance between each pair and return the smallest. Find the smallest distance in O(nLogn) time using Divide and Conquer strategy.

by using c++ . We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications. For example, in air-traffic control, you may want to monitor planes that come too close together, since this may indicate a possible collision. Recall the following formula for distance between two points p and q. Euclidean distance d( p , q ) = sqrt[(qx − px)^2 + (qy − py)^2] The Brute force solution is O(n^2), compute the distance between each pair and return the smallest. Find the smallest distance in O(nLogn) time using Divide and Conquer strategy.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Write a C Program that reads two matrices of integers. It then generates the sum and difference of the two matrices. The sum of the two matrices of the same size is a matrix with elements that are the sums of the corresponding elements of the two given matrices. Addition is not defined for matrices of different sizes. If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, to subtract matrix B from matrix A, we simply subtract corresponding elements. Note: Use array function
Write a C program that reads two matrices of integers. It then generates the sum and difference of the two matrices. The sum of the two matrices of the same size is a matrix with elements that are the sums of the corresponding elements of the two given matrices. Addition is not defined for matrices of different sizes. If A and B are matrices of the same size, then we define subtraction as follows: A – B = A + (-B). Thus, to subtract matrix B from matrix A, we simply subtract corresponding elements.
Write a program in C++ using C-style and array to allow the user to calculate the distance between cities on a map. Sounds pretty complicated, eh? Don't worry, we'll make a few simplifications here: The distances are calculated in map units on the 2D map. Each city is given a set of coordinates relative to some point on the map. We'll call this origin (0,0). There can only be a finite number of cities in the system at a given time (you decide this maximum). But in order to make the system useful, we'll have to add a few other features: Each city has a name in addition to its coordinates (you can assume a maximum length for these names; but they must be able to hold spaces: Los Angeles, New York, etc.). The user selects what action to take from a menu: 1) Enter city Information 2) calculate Distance between two cities 3) Print All cities 4) Quit Make sure you allow them to choose their options by both the number and the capitalized letter(s) of the choice. They cannot…
There are several different types of searching algorithms, but each one has its own specific application and may not be equally suitable for other applications. The size of the array on which the search is to be performed also matters when choosing an appropriate searching algorithm. Which is the most efficient method of searching for an element when the array size is very small? Write a C program for using the same method to search for an element from a very small array of integers. Make up your own data, and be sure to test your program on at least one data set. If the element being searched for is not found in the array, display an appropriate message to the user. USING C PROGRAMMING LANGUAGES AND COMMENT EVERY STEP PLEASE
The problem was to write a program that allocates the integers 1-8 to the squares in the eight numbers in a cross figure, subject to the restrictions that no two adjacent squares contain consecutive integers. By adjacent, we mean vertically, horizontally, or diagonally. Given, the labeling of the eight numbers in a cross figure, use C++ to write the bool okay (int q[], int c) function that includes the helper array.
Answer in C++, show example output please There are three buckets size X, Y, M (1<=X<=Y<=M). All three buckets are initiallyempty. Using these three buckets, we can perform any number of the following twotypes of operations. We can fill the smallest bucket (of size X) completely to the top with X units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. We can fill the medium bucket (of size Y) completely to the top with Y units of water andpour it into the size-M bucket, as long as this will not cause the size-M bucket tooverflow. Although we may not be able to completely fill the size-M bucket, but we can stilldetermine the maximum amount of milk we can possibly add to largest bucket. Sample input:17 25 77 Sample output:76 In this example, we fill the bucket of size 17 three times and then bucket of size 25once, accumulating a total of 76 units of water. You could use additional test case to test your program:Input: 52 791…
In python, Problem Description:Sheldon and Leonard are physicists who are fixated on the BIG BANG theory. In order to exchange secret insights they have devised a code that encodes UPPERCASE words by shifting their letters forward. Shifting a letter by S positions means to go forward S letters in the alphabet. For example, shifting B by S = 3 positions gives E. However, sometimes this makes us go past Z, the last letter of the alphabet. Whenever this happens we wrap around, treating A as the letter that follows Z. For example, shifting Z by S = 2 positions gives B. Sheldon and Leonard’s code depends on a parameter K and also varies depending on the position of each letter in the word. For the letter at position P, they use the shift value of S = 3P + K. For example, here is how ZOOM is encoded when K = 3. The first letter Z has a shift valueof S = 3 × 1 + 3 = 6; it wraps around and becomes the letter F. The second letter, O, hasS = 3 × 2 + 3 = 9 and becomes X. The last two letters…
in c++ You are given an array A of non-negative integers of size m. Your task is to sort the array in increasing order and print out the original indices of the new sorted array. Example: A= {12, 2, 6, 10, 9, 24,23, 33} After sorting the new array becomes A= {2,6,9,10,12,23,24,33}. The required output should be sorted array and original indexes "1 2 4 3 0 6 7", index of 2 in original array was 1 , index for 6 was 2 and so on.
Write a program in C: - Ask the user for the amount of diesel loaded in the submarine.- Asks the user for the magnitude (distance), in meters, and the heading, in degrees of thenavigation to way-point one.- Decompose the vector into x and y components and output the magnitude anddirection (North, West, South, or East are the only reliable headings on the sub’scompass) of the x component and then the y component. The x component is themagnitude multiplied by the cosine of the angle. The y component is the magnitudemultiplied by the sine of the angle. Determine compass direction depending on weatherthe vector component is positive or negative.- Calculate the amount of diesel spent to waypoint 1 and output it. Also output theamount of diesel remaining. (The submarine has a fuel capacity of 175 metric tons ofdiesel but was loaded with 1 ton in the example. The submarine spends 1 ton of dieselper 51 miles traveled.)- This step has to be repeated for another waypoint.- Ask the user for the…
Write a program in C: - Ask the user for the amount of diesel loaded in the submarine.- Asks the user for the magnitude (distance), in meters, and the heading, in degrees of thenavigation to way-point one.- Decompose the vector into x and y components and output the magnitude anddirection (North, West, South, or East are the only reliable headings on the sub’scompass) of the x component and then the y component. The x component is themagnitude multiplied by the cosine of the angle. The y component is the magnitudemultiplied by the sine of the angle. Determine compass direction depending on weatherthe vector component is positive or negative.- Calculate the amount of diesel spent to waypoint 1 and output it. Also output theamount of diesel remaining. (The submarine has a fuel capacity of 175 metric tons ofdiesel but was loaded with 1 ton in the example. The submarine spends 1 ton of dieselper 51 miles traveled.)- This step has to be repeated for another waypoint.- Ask the user for the…
Write an algorithm and A C program that takes an array of N integers (N will be specified by the user at run time). It then copies the numbers that are multiplier of 5 into one array and those that are multiplier of 9 into a separate array. Your program then needs to compute the average of each of these two arrays and print them on the screen.
I need a Clark and Wright Savings Algorithm in Python. Are there any templates already? I have the following distance matrix given: [0, 10, 5, 9999, 9999, 9999, 9999], [10, 0, 5, 15, 20, 9999, 9999], [5, 5, 0, 10, 9999, 9999, 9999], [9999, 15, 10, 0, 15, 20, 15], [9999, 20, 9999, 15, 0, 5, 9999], [9999, 9999, 9999, 20, 5, 0, 20], [9999, 9999, 9999, 15, 9999, 20, 0]