Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
comp.theory
+ new post
About this group
Subscribe to this group
This is a Usenet group - learn more
Message from discussion New Sorting Algorhithm 1-Pass Complete Sort!
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Ben Pfaff  
View profile  
 More options Jan 31 2002, 5:30 pm
Newsgroups: comp.theory
From: Ben Pfaff <b...@cs.stanford.edu>
Date: 31 Jan 2002 14:29:04 -0800
Local: Thurs, Jan 31 2002 5:29 pm
Subject: Re: New Sorting Algorhithm 1-Pass Complete Sort!
Print | View thread | Show original | Report this message | Find messages by this author

"Dann Corbit" <dcor...@connx.com> writes:
> Yes.  In fact, that is the usual implementation.  If you don't own a copy of
> "The Art of Computer Programming" by Donald Knuth, you should definitely get
> one.  Sedgewick, Weiss and Skienna are also MUST HAVES.

I have Knuth and Sedgewick, but I haven't heard of Weiss and
Skienna.  Which book or books in particular?

 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2013 Google