Skip to content
  • Categories
  • Recent
  • Tags
  • Popular
  • World
  • Users
  • Groups
Skins
  • Light
  • Cerulean
  • Cosmo
  • Flatly
  • Journal
  • Litera
  • Lumen
  • Lux
  • Materia
  • Minty
  • Morph
  • Pulse
  • Sandstone
  • Simplex
  • Sketchy
  • Spacelab
  • United
  • Yeti
  • Zephyr
  • Dark
  • Cyborg
  • Darkly
  • Quartz
  • Slate
  • Solar
  • Superhero
  • Vapor

  • Default (No Skin)
  • No Skin
Collapse
Code Project
  1. Home
  2. General Programming
  3. C / C++ / MFC
  4. Need Help

Need Help

Scheduled Pinned Locked Moved C / C++ / MFC
algorithmsdata-structureshelp
4 Posts 3 Posters 0 Views 1 Watching
  • Oldest to Newest
  • Newest to Oldest
  • Most Votes
Reply
  • Reply as topic
Log in to reply
This topic has been deleted. Only users with topic management privileges can see it.
  • N Offline
    N Offline
    NetRams
    wrote on last edited by
    #1

    Hi, Could any one help me to fast my search on Linked list application. Is there any method to search on linked list. Now i am searching by getfirst and getnext function to retrieve the next node datas. Regards Rajesh.

    P 1 Reply Last reply
    0
    • N NetRams

      Hi, Could any one help me to fast my search on Linked list application. Is there any method to search on linked list. Now i am searching by getfirst and getnext function to retrieve the next node datas. Regards Rajesh.

      P Offline
      P Offline
      palbano
      wrote on last edited by
      #2

      For faster searching use indexes and binary search algorthm

      "No matter where you go, there your are." - Buckaroo Banzai

      -pete

      N 1 Reply Last reply
      0
      • P palbano

        For faster searching use indexes and binary search algorthm

        "No matter where you go, there your are." - Buckaroo Banzai

        -pete

        N Offline
        N Offline
        NiteShade
        wrote on last edited by
        #3

        If you want to keep a linked list you won't search very fast, unless you add some other data structures with it. I'd suggest data hashing (order 1 search with a good algorithm) or AVL trees, which are better than binary search trees but require more work. Andrew

        N 1 Reply Last reply
        0
        • N NiteShade

          If you want to keep a linked list you won't search very fast, unless you add some other data structures with it. I'd suggest data hashing (order 1 search with a good algorithm) or AVL trees, which are better than binary search trees but require more work. Andrew

          N Offline
          N Offline
          NetRams
          wrote on last edited by
          #4

          Hi Andrew, Could you provide me more information about AVL trees, it will be great if you provide me some samples. Thanks Rajesh

          1 Reply Last reply
          0
          Reply
          • Reply as topic
          Log in to reply
          • Oldest to Newest
          • Newest to Oldest
          • Most Votes


          • Login

          • Don't have an account? Register

          • Login or register to search.
          • First post
            Last post
          0
          • Categories
          • Recent
          • Tags
          • Popular
          • World
          • Users
          • Groups