正在加载图片...
Example Select the i=th smallest 61013583211i=7 pivot Partition 253681310111k=4 Select the 7-4=3rd smallest recursively o 2001 by Charles E Leiserson Introduction to Algorithms Day 9 L6. 4© 2001 by Charles E. Leiserson Introduction to Algorithms Day 9 L6.4 Example pivot 66 1010 1313 55 88 33 22 1111 i = 7 k = 4 Select the 7 – 4 = 3rd smallest recursively. Select the i = 7th smallest: 22 55 33 66 88 1313 1010 1111 Partition:
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有