Hi all,
I was just wondering, is it possible to write a solution to the
following problem with the following criteria:
1. it must be as efficient as possible at run-time
2. be in O(1)
3. and be memory efficient
The problem is:
Find the total distance between any two cities if:
Given
source city destination city distance
0 1 5
mi.
1 2 2
mi.
2 3 7
mi.
3 4 8
mi.
etc... for N cities.
Example: distance(0, 4) = 5+2+7+8 = 22
The distance function is being called millions and millions of times
and the list of cities and distances do not change after the program
starts.
I initially thought that making an N X N matrix to store all distances
bwteen cities would be a fast way to retrive any distace (the matrix
would be populated as requests for distances are made), i.e. receive
request, if request not in matrix calculate distance from array, store
result in matrix, output result. But the N x N matrix turned out to be
memory expensive.
Ok. so I thought a hash table with a linked list (for collisions) would
solve my memory problem, but I'm not sure whether or not it satisfies
all the requirements for this solution...
What do you guys think? 13 2041
"racygirl" <ra******@hotmail.com> writes: I was just wondering, is it possible to write a solution to the following problem with the following criteria:
1. it must be as efficient as possible at run-time 2. be in O(1) 3. and be memory efficient
The problem is: Find the total distance between any two cities if: Given
[snip] What do you guys think?
I think this is a question for comp.programming. The fact that your
question doesn't mention any particular programming language means
it's not really a comp.lang.c question.
If you have problems implementing a solution in C, feel free to come
back here and ask us.
--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
racygirl wrote: Hi all,
I was just wondering, is it possible to write a solution to the following problem with the following criteria:
1. it must be as efficient as possible at run-time 2. be in O(1) 3. and be memory efficient
The problem is: Find the total distance between any two cities if: Given source city destination city distance 0 1 5 mi. 1 2 2 mi. 2 3 7 mi. 3 4 8 mi.
etc... for N cities. Example: distance(0, 4) = 5+2+7+8 = 22
Let's look at another example:
Atlanta to Houston: 790 mi
Houseton to New York: 1610 mi
New York to Norfolk: 370 mi
By your logic, the distance between Atlanta to Norfolk would be 2770
mi, while it is actually about 560 mi.
The problem you describe is usually solved by storing the position of
each city, say the latitude and longitude, then calculating the
distance between the two positions. This way all you need to do is
look up the two positions and perform the distance calculation.
As for the computational complexity, if you were to always refer to the
cities as numbers that could be used as indices into an array you could
make this lookup O(1). To be useful though you will probably need to
be able to look up city names which can easily be done in O(log n) time
using a tree structure (pick one), hashing could provide close to O(1),
perfect hashing real O(1).
Did you have a C question?
Robert Gamble
racygirl wrote: I was just wondering, is it possible to write a solution to the following problem with the following criteria:
1. it must be as efficient as possible at run-time 2. be in O(1) 3. and be memory efficient
The problem is: Find the total distance between any two cities if: Given source city destination city distance 0 1 5 mi. 1 2 2 mi. 2 3 7 mi. 3 4 8 mi.
etc... for N cities. Example: distance(0, 4) = 5+2+7+8 = 22 The distance function is being called millions and millions of times and the list of cities and distances do not change after the program starts.
I initially thought that making an N X N matrix to store all distances bwteen cities would be a fast way to retrive any distace (the matrix would be populated as requests for distances are made), i.e. receive request, if request not in matrix calculate distance from array, store result in matrix, output result. But the N x N matrix turned out to be memory expensive.
Ok. so I thought a hash table with a linked list (for collisions) would solve my memory problem, but I'm not sure whether or not it satisfies all the requirements for this solution...
What do you guys think?
I have quoted the entire thing. First, it is highly off-topic for
c.l.c, as it deals with algorithms, not the c language. Cross
posted to comp.programming with F'UPs set. Go there for any more.
--
"If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers." - Keith Thompson
More details at: <http://cfaj.freeshell.org/google/>
yeah, not really a language question... thanks any way.
Hi Robert,
Thank you for your help, my problem is actually simpler than that, i'm
given only the distance from one city to the next ordered by city
number. Mark P from another group had a clever idea: "compute all
distances from city 0 to every city, d[i]. To find the distance from i
to j do d[j] - d[i]. " which executes in O(1) at run time with O(n)
memory.
clever huh?
In article <11**********************@g43g2000cwa.googlegroups .com>,
racygirl <ra******@hotmail.com> wrote: Hi Robert,
Robert who? Please give appropriate attributation, and please
quote sufficient previous material to establish context.
Thank you for your help, my problem is actually simpler than that, i'm given only the distance from one city to the next ordered by city number. Mark P from another group had a clever idea: "compute all distances from city 0 to every city, d[i]. To find the distance from i to j do d[j] - d[i]. " which executes in O(1) at run time with O(n) memory.
clever huh?
The problem is so artificial as to appear to be a school
assignment. Because of that, I will not give a solution,
but I will point out that the above algorithm is broken,
as it does not take into account arithmetic overflow in
the sum of the distances.
--
Programming is what happens while you're busy making other plans.
Walter Roberson wrote: In article <11**********************@g43g2000cwa.googlegroups .com>, racygirl <ra******@hotmail.com> wrote:
number. Mark P from another group had a clever idea: "compute all distances from city 0 to every city, d[i]. To find the distance from i
The problem is so artificial as to appear to be a school assignment. Because of that, I will not give a solution, but I will point out that the above algorithm is broken, as it does not take into account arithmetic overflow in the sum of the distances.
Overflow? How many cities are going to be more than 32767 miles apart?
(Or 2 billion miles on most PCs). Maybe in millimetres there might be a
problem.
bart
Bart wrote: Walter Roberson wrote:
In article <11**********************@g43g2000cwa.googlegroups .com>, racygirl <ra******@hotmail.com> wrote:
number. Mark P from another group had a clever idea: "compute all distances from city 0 to every city, d[i]. To find the distance from i
The problem is so artificial as to appear to be a school assignment. Because of that, I will not give a solution, but I will point out that the above algorithm is broken, as it does not take into account arithmetic overflow in the sum of the distances.
Overflow? How many cities are going to be more than 32767 miles apart? (Or 2 billion miles on most PCs). Maybe in millimetres there might be a problem.
32767 millimetres = 32 metres. Sounds like conurbation.
2E9 millimetres = 2E6 metres = 2E3 kilometres. Feasible.
Apart from that, int was never mentioned.
Cheers
Michael
--
E-Mail: Mine is an /at/ gmx /dot/ de address.
In article <11**********************@g14g2000cwa.googlegroups .com>,
Bart <bc@freeuk.com> wrote: Walter Roberson wrote:
The problem is so artificial as to appear to be a school assignment. Because of that, I will not give a solution, but I will point out that the above algorithm is broken, as it does not take into account arithmetic overflow in the sum of the distances.
Overflow? How many cities are going to be more than 32767 miles apart? (Or 2 billion miles on most PCs). Maybe in millimetres there might be a problem.
If I were creating an assignment for a class that was required
to have certain behaviours, I would likely create test-case
drivers to be run through automatically -- and I wouldn't hesitate to
put in a test case that included very large distances, alongside
test cases that input negative numbers, strings, empty lines, and
so on.
--
"No one has the right to destroy another person's belief by
demanding empirical evidence." -- Ann Landers
>Let's look at another example: Atlanta to Houston: 790 mi Houseton to New York: 1610 mi New York to Norfolk: 370 mi
By your logic, the distance between Atlanta to Norfolk would be 2770 mi, while it is actually about 560 mi.
The first example may be correct, if you're talking about airline
miles rather than as-the-missile-flies distances.
The problem you describe is usually solved by storing the position of each city, say the latitude and longitude, then calculating the distance between the two positions. This way all you need to do is look up the two positions and perform the distance calculation.
Unfortunately, it's not possible to GET a (nonstop) commercial
flight from Airport A to Airport B for all possible pairs of A and
B. Things such as the Wright Amendment make certain (commercial)
flights illegal, and others just don't have enough traffic to make
them worthwhile. Also, some airports may not be able to handle all
flights (an intercontinental flight from Paris, France to Northwest
Pothole, Texas may find the runways too short for anything but crop
dusters to land).
Gordon L. Burditt
racygirl wrote: Whatever
I think you have been told enough times how to include proper
context even on the google interface, and you just ignore it. I
for one don't want to put up with these meaningless postings, so
goodbye. PLONK (which means your posts will never reach here in
the future).
--
"If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers." - Keith Thompson
More details at: <http://cfaj.freeshell.org/google/>
racygirl wrote: Whatever
*plonk*
Brian This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics
by: Jayne Wolps |
last post by:
Hello
I wonder if anyone can help.
I would like to know how certain sites:
http://aboutbritain.com/ArundelCastle.htm, and
http://travel.knowhere.co.uk/place/+bristol-0/ manage to put approx...
|
by: Ron Adam |
last post by:
Hi, I'm having fun learning Python and want to say thanks to everyone
here for a great programming language.
Below is my first Python program (not my first program) and I'd
apreciate any...
|
by: Kasp |
last post by:
Hi there,
I am trying to make an OLAP cube on a table having two columns (datetime,
Number_of_times_an_event_occured).
My dimension is time and I want to measure the Min and Max times an event...
|
by: Joe Bongiardina |
last post by:
What does the message "calculating...." mean in the lower left status area
of a form?
I have a form with no calculated, concatenated or lookup fields, yet it
displays this msg.
The form takes...
|
by: jlm |
last post by:
I have a form which feeds table (TblEmpLeave) of Employee Leave Time
(time taken off for Administrative, Annual, Sick, Compensation leave).
I have EmpID, LeaveDate, LeaveType, LeaveHours fields on...
|
by: robin9876 |
last post by:
In an Access 2000 database on some forms 'Calculating...' is
continuously displayed in the status bar window and the text of the
control is automatically selected.
The only workaround is switching...
|
by: Hul Tytus |
last post by:
comp.lang.c
converting a point known by 4 distances to xyz coordinates?
Amongst all the librarys on the internet there is certainly source for
a routine that converts a point known by 4...
|
by: tienlx |
last post by:
Hi,
I've a report (ReportAppointment.rdlc) in ASP.NET
When viewing reports, the vertical distance between the two group are
too big. I've tried to reduce the vertical distances but i can't.
Demo:...
|
by: Paul Aspinall |
last post by:
Hi
Can anyone recommend a suitable way of calculating distances between UK post
codes??
Many websites do this, and I'm wondering if there is some standard code, and
where the reference DB comes...
|
by: BarryA |
last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
|
by: nemocccc |
last post by:
hello, everyone, I want to develop a software for my android phone for daily needs, any suggestions?
|
by: Sonnysonu |
last post by:
This is the data of csv file
1 2 3
1 2 3
1 2 3
1 2 3
2 3
2 3
3
the lengths should be different i have to store the data by column-wise with in the specific length.
suppose the i have to...
|
by: Hystou |
last post by:
There are some requirements for setting up RAID:
1. The motherboard and BIOS support RAID configuration.
2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
|
by: marktang |
last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However,...
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can...
|
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven...
|
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each...
| |