Results 1 to 3 of 3

Thread: Adding to a priority Queue

  1. Dec 6th, 2001, 06:36 PM #1
    boyracer38
    boyracer38 is offline

    Thread Starter
    Lively Member
    Join Date
    Nov 2001
    Posts
    117

    Angry Adding to a priority Queue

    I need to add an element with a given priority to a sorted priority queue.

    Also.... can someone give me the psuedo code for it??

    Thanx to those who replied to my previous post, but it didnt really help

    Jason
    Reply With Quote Reply With Quote
  2. Dec 6th, 2001, 07:21 PM #2
    kedaman
    kedaman is offline
    transcendental analytic kedaman's Avatar
    Join Date
    Mar 2000
    Location
    0x002F2EA8
    Posts
    7,221
    Priority queues aren't sorted, they are heaps. Do you want a technical description on how a heap works?
    Use
    writing software in C++ is like driving rivets into steel beam with a toothpick.
    writing haskell makes your life easier:
    reverse (p (6*9)) where p x|x==0=""|True=chr (48+z): p y where (y,z)=divMod x 13
    To throw away OOP for low level languages is myopia, to keep OOP is hyperopia. To throw away OOP for a high level language is insight.
    Reply With Quote Reply With Quote
  3. Dec 7th, 2001, 07:36 AM #3
    HarryW
    HarryW is offline
    Frenzied Member HarryW's Avatar
    Join Date
    Jan 2000
    Location
    Heiho no michi
    Posts
    1,827
    Priority queues (made with heaps) are just a spectial kind of balanced binary tree. Do you know how to make a binary tree?
    Harry.

    "From one thing, know ten thousand things."
    Reply With Quote Reply With Quote
« Previous Thread | Next Thread »

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  

Forum Rules


Click Here to Expand Forum to Full Width