View Single Post
  #4   (View Single Post)  
Old 3rd November 2008
TerryP's Avatar
TerryP TerryP is offline
Arp Constable
 
Join Date: May 2008
Location: USofA
Posts: 1,547
Default

Well, it might sound stupid, but I learned how to implement such things using Wikipedia, GCC, and GDB lol. Lists, Stacks, and Queues are all similar enough that if you figure out how to implement one, the others should fall into place quick enough. Tree structures on the other hand can be a bit tricky at first. The main difference from C++ implementations, you won't find OO syntax used even though some C programs are written in an object oriented style. That, and there is no STL... lol.


For books, I have never read it but [http://oreilly.com/catalog/9781565924536/]Mastering Algorithms with C[/url] from O'Reilly might be a good buy.
__________________
My Journal

Thou shalt check the array bounds of all strings (indeed, all arrays), for surely where thou typest ``foo'' someone someday shall type ``supercalifragilisticexpialidocious''.

Last edited by TerryP; 3rd November 2008 at 05:28 AM.
Reply With Quote