File:Kth pair algorithm for finding median of matrix with sorted rows and columns.gif
Size of this preview: 800 × 600 pixels. Other resolutions: 320 × 240 pixels | 640 × 480 pixels | 1,024 × 768 pixels | 1,200 × 900 pixels.
Original file (1,200 × 900 pixels, file size: 1.08 MB, MIME type: image/gif, looped, 28 frames, 42 s)
 | This is a file from the Wikimedia Commons. Information from its description page there is shown below. Commons is a freely licensed media file repository. You can help. |
Summary
| Description |
English: This shows the Kth pair algorithm of Johnson and Mizoguchi. This is a matrix with sorted rows and sorted columns, i.e. going down or going right along any row always darkens that row. At each iteration, the algorithm finds the weighted median of row medians in yellow then compares it to the rest of the matrix. It proceeds by building upper boundaries in red and lower boundaries in blue by comparing the matrix to the candidate target in yellow. Once the remaining entries are few, a direct selection sort is possible |
| Date | |
| Source | With some Python and Octave. Links to GPL'ed source code below |
| Author | JordiGH |
- Other information
English: This was created using the following code:
http://inversethought.com/hg/medcouple/file/tip/talk/code/show_mc.py
http://inversethought.com/hg/medcouple/file/tip/talk/code/showalgo.m
The Python code creates data which the Octave code then displays.Licensing
I, the copyright holder of this work, hereby publish it under the following licenses:
|
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled GNU Free Documentation License. |
This file is licensed under the Creative Commons Attribution-Share Alike 4.0 International license.
- You are free:
- to share – to copy, distribute and transmit the work
- to remix – to adapt the work
- Under the following conditions:
- attribution – You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- share alike – If you remix, transform, or build upon the material, you must distribute your contributions under the same or compatible license as the original.
You may select the license of your choice.
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 00:42, 8 August 2016 | | 1,200 × 900 (1.08 MB) | JordiGH | {{subst:Upload marker added by en.wp UW}} {{Information |Description = {{en|This shows the Kth pair algorithm of Johnson and Mizoguchi. This is a matrix with sorted rows and sorted columns, i.e. going down or going right along any row always darkens th... |
File usage
The following pages on the English Wikipedia use this file (pages on other projects are not listed):
