| Ticket UUID: | 846422 | |||
| Title: | New sort method for matrix object | |||
| Type: | Patch | Version: | None | |
| Submitter: | nobody | Created on: | 2003-11-21 07:33:14 | |
| Subsystem: | struct :: matrix | Assigned To: | andreas_kupries | |
| Priority: | 5 Medium | Severity: | ||
| Status: | Closed | Last Modified: | 2004-01-24 04:13:38 | |
| Resolution: | Accepted | Closed By: | andreas_kupries | |
| Closed on: | 2004-01-23 21:13:38 | |||
| Description: |
I needed to sort a matrix, and wound up spending an evening implementing sort methods for the struct::matrix extension. The methods use the heapsort algorithm, which is explained in "Introduction to Algorithms" by Thomas H. Cormen et al. (Copyright 2001 by MIT). The book's preface says "If you wish to implement any of the algorithms, you will find the translation of our pseudo code into your favorite programming language a fairly straightforward task." That was my experience -- it was actually pretty fun. | |||
| User Comments: |
andreas_kupries added on 2004-01-24 04:13:38:
Logged In: YES user_id=75003 Implemented in the CVS head, with modifications. edsuom added on 2003-11-21 14:34:55: Logged In: YES user_id=302938 Forgot to log in...but this was from me (Ed Suominen). Also, if I can figure out how, I'll submit a diff for easy reference. nobody added on 2003-11-21 14:33:14: File Added - 68155: matrix.tcl | |||
Attachments:
- matrix.tcl [download] added by nobody on 2003-11-21 14:33:14. [details]