Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

Im having trouble understanding arrays using distance and input !!! PLEASE Proje

ID: 3914408 • Letter: I

Question

Im having trouble understanding arrays using distance and input !!! PLEASE

Project #6: Demonstrate 2D arrays. Write a program that uses a 2D array to store the distance between 10 different cities. (Use the following cities: A,B,C,D,E,F,G,H,I,J.) The user should be able to select any two cities and find the distance between the cities. This program should continue to display chosen distances as long as the user submits two cities.

A - B:152.7 miles
A- C:188.4 miles
A - D:571.3 miles
A - E:216.4 miles
A - F:42.21 miles
A - G:186.5 miles
A - H: 98.4 miles
A - I:201.0 miles
A - J:224.6 miles

B- A :152.7
B - C:239.0 miles
B- D: 634.7 miles
B- E:65.0 miles
B- F:167.3 miles
B - G:97.7 miles
B - H:191.4 miles
B- I:328.6 miles
B - J:352.2 miles

C - A:188.4 miles
C- B :239.0 miles
C - D:74.7 miles
C - E:301.6 miles
C - F:154.2 miles
C - G:198.2 miles
C- H:106.1 miles
C- I :233.9 miles
C - J:254.4 miles

D- A:571.3 miles
D- B:634.7 miles
D- C:74.7 miles
D- E:692.9 miles
D - F:607.3 miles
D- G: 732.5 miles
D - H:641.8 miles
D - I:570.4 miles
D - J: 540.5

E - A:216.4 miles
E - B :65.0 miles
E - C :301.6 miles
E - D: 692.9 miles
E - F:232.0 miles
E- G:127.2 miles
E- H:257.4 miles
E- I:377.3 miles
E- J: 400.9 miles

F - A:42.21 miles
F- B:167.3 miles
F- C:154.2 miles
F- D:607.3 miles
F- E: 232.0 miles
F-G:189.7 miles
F- H:45.9 miles
F- I:163.7 miles
F - J: 187.3 miles

G - A:186.5 miles
G- B:97.7 miles
G- C:198.2 miles
G- D:732.5 miles
G- E:127.2 miles
G-F:189.7 miles
G- H:183.0 miles
G- I:346.5 miles
G - J:370.2 miles

H - A:98.4 miles
H- B:191.4 miles
H- C:106.1 miles
H-D:641.8 miles
H- E:257.4 miles
H- F:45.9 miles
H-G:183.0 miles
H-I:177.0 miles
H-J:197.5 miles

I- A:201.0 miles
I--B:328.6 miles
I-C:233.9 miles
I-D: 570.4 miles
I-E:377.3 miles
I-F:163.7 miles
I-G:346.5 miles
I-H:177.0 miles
I-J:30.2 miles

J-A:224.6 miles
J- B :352.2 miles
J- C:254.4 miles
J- D:540.5 miles
J- E:400.0 miles
J- F:187.3 miles
J- G:370.2 miles
J- H:197.5 miles
J- I:30.2 miles

i have some of the code writtens but i have etenouis errors

even just the start of the decision and loops would help a ton

Explanation / Answer

To store distance between 10 different cities, every city will be mapped to nine remaining cities. The best way is to create a 2D array with 10 rows and 10 columns ( imagine a 10 X 10 matrix with rows and columns denoting the city names ) i.e. city[10][10]

       A          B         . .    J

A     0           152.7              224.6

B 152.7         0                   352.2
.
.
J 224.6      352.2                  0

Note that distance between the pair of same cities is zero.


while true:
//this will create an infinite loop which would break only when two valid cities are not supplied

     i , j = input_cities()
     //Every time on entering the loop take input from the user. Store the ASCII values of the two cities in two variables. Let us say i and j

     i = i - 65, j = j - 65
     //since alphabets are in capital letters therefore ASCII value of 'A' is used

     if ( i<0 or i>9 or j<0 or j>9 or i==j)
         print error
         break
     else
         print city[i][j]

Till cities between A to J are supplied (excluding identical cities), the loop would continue to print distance between them.