sort-quicksort.html
来自「经典的数据结构源代码(java 实现)」· HTML 代码 · 共 17 行
HTML
17 行
<html><head><title>Code Fragment</title></head><body text=#000000><center></center><br><br><dl><dd><pre> <font color=#8000a0><font color=#8000a0>public</font> </font><font color=#8000a0>static</font> <E> <font color=#8000a0><font color=#8000a0>void</font> </font><font color=#0000ff>quickSort </font>(E[] s, Comparator<E> c) { <font color=#ff8000>if</font><font color=#0000ff> </font>(s.length < 2) <font color=#ff8000>return</font>; <font color=#ff0080>// the array is already sorted in this case</font> <font color=#0000ff>quickSortStep</font>(s, c, 0, s.length-1); <font color=#ff0080>// recursive sort method</font> }</dl></body></html>
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?