Sorting & Searching

[Kuku]

Hi,

Can anyone please tell me good books/sites for sorting and searching.
Finding it a little hard to understand

 

[Michael Mair]

Can anyone please tell me good books/sites for sorting and searching.
Finding it a little hard to understand

"Algorithms in C", Sedgewick. Part 1-4 treats sorting and searching,
among other things.

Cheers
Michael

 

[Richard Heathfield]

Kuku said:

Hi,

Can anyone please tell me good books/sites for sorting and searching.

"The Art of Computer Programming", Volume 3, "Sorting and Searching", by
Donald E Knuth.

Finding it a little hard to understand

Well, basically it's easier to find stuff if it's in order than if it's all
jumbled up. Everything else is tweaking (quite major tweaking in some
cases) and commentary.

 

[osmium]

"The Art of Computer Programming", Volume 3, "Sorting and Searching", by
Donald E Knuth.

Focusing on the sort part of your question. I think the best way to get
started in this is to look for Java applets on the internet. I think there
are literally hundreds of them, some quite good. If you are having trouble,
the last thing you want is the Knuth book It will just make you feel more
stupid than you already do.

Try using words such as applet, primer, and tutorial in a Google search.
Here are a few, picked more or less at random.

http://www.geocities.com/siliconvalley/network/1854/Sort1.html
http://www.cse.iitk.ac.in/users/dsrkg/cs210/applets/sortingII/quickSort/quick.html
http://www-cse.uta.edu/~holder/courses/cse2320/lectures/applets/quicksort/

After you get the fundamentals down, visit the book store of a nearby
college and see what data structures books they have in stock. There might
even be something useful in a public library.

 

[pete]

Focusing on the sort part of your question.

The best part is, that if you can read the whole thing,
then Bill Gates wants your resume!

http://www.google.com/search?hl=en&...if+you+can+read+the+whole+thing"+"bill+gates"

Knuth is not light reading.
However, Knuth is substantial to the point where something that
I once heard Pablo Picaso say on television, applies:
"What I have to say is so substantial,
that if you only understand a little bit,
it is enough."

I learned heapsort and Shellsort and quicksort from Knuth.

I think the best way to get
started in this is to look for Java applets on the internet.

I learned mergesort from a Java applet on the internet.
I don't recall where I learned bubblesort and insertionsort.

How to implement bsearch as an O(log(N)) algorithm,
should be obvious,
if you can understand either heapsort or quicksort,
or maybe even if you can't.