J
jonathan.dyer
here is the problem
write a function tht uses a switch statement to determine the number of
the nearest cross street for a given address and avenue number
according to the preceding algorithm. the write a program to test the
function.
1st ave +3
2nd ave +3
3rd ave +10
4th ave +8
5th ave up to 200 +13
5th ave up to 400 +16
6th ave -12
7th ave +12
8th ave +10
10th ave +14.
write a function tht uses a switch statement to determine the number of
the nearest cross street for a given address and avenue number
according to the preceding algorithm. the write a program to test the
function.
1st ave +3
2nd ave +3
3rd ave +10
4th ave +8
5th ave up to 200 +13
5th ave up to 400 +16
6th ave -12
7th ave +12
8th ave +10
10th ave +14.