[Bluej-discuss] Please its very important

[andrea Valente]

Nice little puzzle you have there.

How about: a 2d array that models the train time-tables, for some given cities?
Something like this:

           train 1    train 2    ...
city 1    10:00     15:20
city 2    11:00     16:00
city 3    11:30     16:25
...

which means: if you take train1, you start at city1 at 10:00 and you
will be at city2 at 11:00, so 1h, and so on.

Your students would have to:
- load the tables or read them from file (or use a fixed one, for simplicity)
- compute the time to go from city i to city j, with a given train.
- search/compute for the fastest train to go from city i to city j.
- update the table to reflect (for example) a better performance by train2.
I'm not sure about sorting...

Let me know what you think about this...  ;)

Sincerelly,
   Andrea


On 8/5/06, Husain Kman <kman.headshot at gmail.com> wrote:
> I want you to giv me suggestion for a project in which there should be -
>  arrays 2d
>  sorting , searching and modification of arrays
>  the topic should be challenging and not very easy
>
>
> _______________________________________________
> mailing list bluej-discuss at bluej.org
> To unsubscribe or change your preferences, go to
> http://lists.bluej.org/mailman/listinfo/bluej-discuss
>
>
>


-- 
=============
Andrea Valente
www.aaue.dk/~av