|
<span class="hljs-meta">@Override
<span class="hljs-keyword">public <span class="hljs-function"><span class="hljs-keyword">void <span class="hljs-title">sort<span class="hljs-params">(T[] list,Comparator comp) {
<span class="hljs-keyword">boolean swapped = <span class="hljs-keyword">true;
<span class="hljs-keyword">for (<span class="hljs-keyword">int i = <span class="hljs-number">1,len = list.length; i < len && swapped; ++i) {
swapped = <span class="hljs-keyword">false;
<span class="hljs-keyword">for (<span class="hljs-keyword">int j = <span class="hljs-number">0; j < len - i; ++j) {
<span class="hljs-keyword">if (comp.compare(list[j],list[j + <span class="hljs-number">1]) > <span class="hljs-number">0) {
T temp = list[j];
list[j] = list[j + <span class="hljs-number">1];
list[j + <span class="hljs-number">1] = temp;
swapped = <span class="hljs-keyword">true;
}
}
}
}
}
<span class="cke_reset cke_widget_drag_handler_container"><img class="cke_reset cke_widget_drag_handler" title="点击并拖拽以移动" src="data:image/gif;base64,R0lGODlhAQABAPABAP///wAAACH5BAEKAAAALAAAAAABAAEAAAICRAEAOw==" alt="" width="15" height="15" data-cke-widget-drag-handler="1">
95、用Java写一个折半查找。
（编辑：网站开发网_盐城站长网 ）
【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!
|
