A Conversation for Tree Searching Algorithms
'A' level Computer Studies
Bright Blue Shorts Started conversation Oct 10, 2002
When I did my 'A' level in Computer Studies way back when it was still nerdy circa the end of the 1980s ... I think we spent most of time programming search algorithms or binary chops!
Interesting, but dull!
BBS 
'A' level Computer Studies
kjudson Posted Aug 4, 2003
You'll be pleased to know it hasn't changed much! I've just finished a level computing and we spent a lot of time programming search and sort algorithms.
yup it's boring, but it's fun (for all of 5 mins) just played around with making the forms look 'nice' 
'A' level Computer Studies
xyroth Posted Aug 7, 2003
There is a very good reason why you learn this at A level.
it is because most of the stuff in computing involves massive amounts of data, which is either ordered (which involves sorting) or not (which involves searching).
it is so much the case that knuth's art of computer programming volume 3 is entirely dedicated to searching and sorting.
it really is fundamental to any advanced level programming.
'A' level Computer Studies
Bright Blue Shorts Posted Aug 7, 2003
Interestingly though in my 13 subsequent years as an applications programmer, I don't think I've ever had to write one ...
'A' level Computer Studies
xyroth Posted Aug 7, 2003
It depends how close to the ground you drag your knuckles. 
Seriously, if you are working with databases and expert systems, it is all done for you (although you sometimes still need to know the underlying method to get the best results from your queries).
If on the other hand you write more systems level code, you are not working at such a high level of abstraction, and might need to write one regularly.
When I worked on the software for an internet cafe back in 1984, we had to write a couple of different ones for different tasks. now that I am working on the zyra internet tools, the same thing applies.
However you can sometimes use a basic sort function from a library if you use the right languages and your requirements are not too demanding.
Search functions are much harder to find in libraries, because they are very much ad-hoc searches of databases, which rely on both the underlying structure of the database, and the information you are searching for.
You just can't make them general enough while still making them efficient.
Key: Complain about this post
'A' level Computer Studies
More Conversations for Tree Searching Algorithms
Write an Entry
"The Hitchhiker's Guide to the Galaxy is a wholly remarkable book. It has been compiled and recompiled many times and under many different editorships. It contains contributions from countless numbers of travellers and researchers."