Need to make a flowchart for the following code:
public static void main(String[] args) {
int num_cities;
double[][] city_coordinates;
Scanner in = new Scanner(System.in);
System.out.print("Enter the number of cities: ");
num_cities = in.nextInt();
city_coordinates = new double[num_cities][2];
System.out.print("Enter the coordinates of the cities: ");
for (int i = 0; i < city_coordinates.length; i++) {
city_coordinates[i][0] = in.nextDouble();
city_coordinates[i][1] = in.nextDouble();
}
// Get the city with the smallest distance to the all other cities
double min_distance = Double.MAX_VALUE;
int min_index = 0;
for (int i = 0; i < city_coordinates.length; i++) {
double distance = 0;
for (int j = 0; j < city_coordinates.length; j++) {
if (i != j) {
distance += Math.sqrt(Math.pow(city_coordinates[i][0] - city_coordinates[j][0], 2)
+ Math.pow(city_coordinates[i][1] - city_coordinates[j][1], 2));
}
}
if (distance < min_distance) {
min_distance = distance;
min_index = i;
}
}
// Get total distance to all other cities
double total_distance = 0;
for (int i = 0; i < city_coordinates.length; i++) {
if (i != min_index) {
total_distance += Math.sqrt(Math.pow(city_coordinates[min_index][0] - city_coordinates[i][0],
2)
+ Math.pow(city_coordinates[min_index][1] - city_coordinates[i][1], 2));
}
}
System.out.printf("The central city is at (%.1f, %.1f)\n", city_coordinates[min_index][0],
city_coordinates[min_index][1]);
System.out.printf("The total distance to all other cities is %.2f\n", total_distance);
}
}.
Andreas Schleicher presents at the launch of What does child empowerment mean...
Need to make a flowchart for the following codepublic static voi.pdf
1. Need to make a flowchart for the following code:
public static void main(String[] args) {
int num_cities;
double[][] city_coordinates;
Scanner in = new Scanner(System.in);
System.out.print("Enter the number of cities: ");
num_cities = in.nextInt();
city_coordinates = new double[num_cities][2];
System.out.print("Enter the coordinates of the cities: ");
for (int i = 0; i < city_coordinates.length; i++) {
city_coordinates[i][0] = in.nextDouble();
city_coordinates[i][1] = in.nextDouble();
}
// Get the city with the smallest distance to the all other cities
double min_distance = Double.MAX_VALUE;
int min_index = 0;
for (int i = 0; i < city_coordinates.length; i++) {
double distance = 0;
for (int j = 0; j < city_coordinates.length; j++) {
if (i != j) {
distance += Math.sqrt(Math.pow(city_coordinates[i][0] - city_coordinates[j][0], 2)
+ Math.pow(city_coordinates[i][1] - city_coordinates[j][1], 2));
}
}
if (distance < min_distance) {
min_distance = distance;
min_index = i;
}
}
// Get total distance to all other cities
double total_distance = 0;
for (int i = 0; i < city_coordinates.length; i++) {
if (i != min_index) {
2. total_distance += Math.sqrt(Math.pow(city_coordinates[min_index][0] - city_coordinates[i][0],
2)
+ Math.pow(city_coordinates[min_index][1] - city_coordinates[i][1], 2));
}
}
System.out.printf("The central city is at (%.1f, %.1f)n", city_coordinates[min_index][0],
city_coordinates[min_index][1]);
System.out.printf("The total distance to all other cities is %.2fn", total_distance);
}
}
![Need to make a flowchart for the following code:
public static void main(String[] args) {
int num_cities;
double[][] city_coordinates;
Scanner in = new Scanner(System.in);
System.out.print("Enter the number of cities: ");
num_cities = in.nextInt();
city_coordinates = new double[num_cities][2];
System.out.print("Enter the coordinates of the cities: ");
for (int i = 0; i < city_coordinates.length; i++) {
city_coordinates[i][0] = in.nextDouble();
city_coordinates[i][1] = in.nextDouble();
}
// Get the city with the smallest distance to the all other cities
double min_distance = Double.MAX_VALUE;
int min_index = 0;
for (int i = 0; i < city_coordinates.length; i++) {
double distance = 0;
for (int j = 0; j < city_coordinates.length; j++) {
if (i != j) {
distance += Math.sqrt(Math.pow(city_coordinates[i][0] - city_coordinates[j][0], 2)
+ Math.pow(city_coordinates[i][1] - city_coordinates[j][1], 2));
}
}
if (distance < min_distance) {
min_distance = distance;
min_index = i;
}
}
// Get total distance to all other cities
double total_distance = 0;
for (int i = 0; i < city_coordinates.length; i++) {
if (i != min_index) {](https://image.slidesharecdn.com/needtomakeaflowchartforthefollowingcodepublicstaticvoi-231005213618-8101975f/85/Need-to-make-a-flowchart-for-the-following-codepublic-static-voi-pdf-1-320.jpg)
![total_distance += Math.sqrt(Math.pow(city_coordinates[min_index][0] - city_coordinates[i][0],
2)
+ Math.pow(city_coordinates[min_index][1] - city_coordinates[i][1], 2));
}
}
System.out.printf("The central city is at (%.1f, %.1f)n", city_coordinates[min_index][0],
city_coordinates[min_index][1]);
System.out.printf("The total distance to all other cities is %.2fn", total_distance);
}
}](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)