Re: [Dev-C++] student needs a little help

[Jason H. <jas...@bt...>]

MessageIt says in the specification that you should read in the data =
file, and suggests a list would be the best data structure to use. If =
you were modelling on real world use you would want as much data as =
possible in memory to allow speedy searches. An orderd list or some =
similar container type would provide a fast and flexible system for data =
storage and retrieval.

Jason.
  ----- Original Message -----=20
  From: Ioannis Vranos=20
  To: Dev-C++=20
  Sent: Saturday, February 16, 2002 4:11 AM
  Subject: RE: [Dev-C++] student needs a little help


  Why should he use any container at all? His "container" in the =
particular case is the data file.


  Ioannis

  * Ioannis Vranos
  * Programming pages: http://www.noicys.d2g.com
  * Alternative URL: http://run.to/noicys

    -----Original Message-----
    From: dev...@li... =
[mailto:dev...@li...] On Behalf Of Benjamin =
Wheeless
    Sent: Saturday, February 16, 2002 5:57 AM
    To: dev...@li...
    Subject: Re: [Dev-C++] student needs a little help


    I would agree with Jason on using a map, but then again...if the =
assignment is for you to develop a linked list implementation, then you =
need to research linked lists.  You are going to want to have a good =
grasp of pointers before you start, so if you are rusty on pointers you =
need to start there.

    I used to know of a really good sight that explained several =
interesting data structures, including linked lists, but I cannot find =
the link right now.

    I did find this one, that does give some code snippets which should =
get you started:
    http://www.inquiry.com/techtips/cpp_pro/10min/10min0599.asp

    If you need more information, I would recommend going to =
http://www.google.com and doing a search on linked lists.  You'll be =
amazed at how much is actually out there.

    Hope that helps you out.

    Benjamin Wheeless
    Network Systems - Delta Airlines, Inc.
    Atlanta, GA - USA 30320
    =
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D