Re: HEAP SORT

Hi Ben,
i think 'ullmann ' is very difficult for a bigginer to understand,
instead 'algorithms in c++' by robert sedgewick is much easier read and
terrafic too.

Ben Bacarisse wrote:
On Fri, 24 Feb 2006 13:35:50 -0800, Radha wrote:

Thank you Chris and Ben. I need to write a proof that the worst case is
O(nlogn). I was hoping somebody could help me with that.

Sounds like a teaching exercise. Your library should have at least one
book with such a proof. I used to use Aho, Hopcroft and Ullman: "The
Design and Analysis of Computer Algorithms" but there must be 100s of
texts with such a proof in them.

--
Ben.

.

Relevant Pages

  • Re: any info on graphs algorithms examples ?
    ... adjacent matriz or with linked list, and how can I visit the vertex. ... Any sample code ??? ... Algorithms in C Parts 1-5 by Robert Sedgewick, ...
    (comp.lang.c)
  • Re: any info on graphs algorithms examples ?
    ... adjacent matriz or with linked list, and how can I visit the vertex. ... Any sample code ??? ... Algorithms in C Parts 1-5 by Robert Sedgewick, ...
    (comp.lang.c)
  • Re: good algorithms come with practice and reading good code/books?
    ... I also suggest as a reference Herb Schildt's Complete Reference ... and algorithms was Mastering Algorithms with C ISBN ... also to suggest Algorithms in C parts 1-5, by Robert Sedgewick. ... suitable for quoting and easy searching with less is available, ...
    (comp.lang.c)
  • Algorithms in C# - book recommendation!
    ... I'm starting to dive into algorithms in general ... currently reading a book from Robert Sedgewick called "Algorithms in C++, ... Edition" and would like other book recommendations on algorithms, ...
    (microsoft.public.dotnet.languages.csharp)