home bbs files messages ]

Forums before death by AOL, social media and spammers... "We can't have nice things"

   comp.lang.pascal.borland      Borland Pascal was actually pretty neat      2,978 messages   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]

   Message 2,250 of 2,978   
   Femme Verbeek to yaniv.dg@gmail.com   
   Re: sorting stack data with pop and push   
   24 Aug 06 22:22:44   
   
   From: fv@nospam.tcenl.com   
      
   yaniv.dg@gmail.com schreef:   
   > no,there is a prepared function that are working as a stack,i'm   
   > compiling them to a unit and then working with it,the issue is that i   
   > need to find a way to sort it with 3 "boxes"   
   > i think that the way that mm offered is the most reasonble for this i   
   > just dont know how exacly to implement it   
   >   
      
   There is no way anybody can answer your question unless you provide lots   
     and lots more information.   
   What function? Do you mean a recursive one? Take a look at the   
   FIB8087.PAS example.   
   Boxes? Do you mean a linked list with node pointers?   
   What are you trying to sort and how does it have to be sorted.   
   What kind of sorting algoritm?   
   The Hanoi tower is an ancient puzzle with piled rings of increasing size   
   around one of three poles. You have to move the tower to another pole   
   moving one ring at the time. Never is it allowed that a larger ring lies   
   on top of a smaller one.   
      
   Posting code here is usually the best way to get lots of response.   
      
   -- Femme   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   

[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]


(c) 1994,  bbs@darkrealms.ca