거품 정렬 예, 양방향 거품 정렬의 약간 개선 된 시각화와 함께 양방향 거품 정렬.
코드는 매우 간단합니다. 알 수없는 버그가 있는지 모르겠습니다.
하나님, 불평하지 마십시오
버블 분류 예제
var ls = [ 98,13,6,25,36,30,44,38,80,61,28,47,34,95,18,85,58,89,85,61,74,35,1 3,14,80,7,44,10,47,13,11,52,25,24,48,34,12,88,80,33,80,45,52,79,77 ]; for (var i = 0; i <ls.length; i ++) {for (var j = i+1; ls [j] = ls [i] -ls [j]; ls [i] = ls [i] -ls [j]; }}}양방향 버블 분류 예제
var ls = [ 6,13,98,25,36,30,44,38,80,61,28,47,34,95,18,85,58,89,85,42,61,35,1 3,14,80,7,44,10,47,13,11,52,25,24,48,34,12,88,80,33,80,45,52,79,77 ]; for (var i = 0; i <ls.length; i ++) {for (var j = i+1; ls [lent-j] = ls [lent-1-i] -ls [lent-j]; ls [lent-1-i] = ls [lent-1-i] -ls [lent-j]; ls [lent-1-i] = ls [lent-1-i] -ls [lent-j]; } // 다음 비교 if (ls [i]> ls [j]) {ls [i] = ls [i]+ls [j]; ls [j] = ls [i] -ls [j]; ls [i] = ls [i] -ls [j]; } // 이전 비교}}약간 개선 된 양방향 버블 정렬의 예
var ls = [ 98,13,6,25,36,30,44,38,80,61,28,47,34,95,18,85,58,89,85,61,74,35,1 3,14,80,7,44,10,47,13,11,52,25,24,48,34,12,88,80,33,80,45,52,79,77 ]; var lent = ls.length; for (var i = 0; i <ls.length; i ++) {for (var j = i*2; ls [j+1] = ls [i*2] -ls [j+1]; ls [i*2] = ls [i*2] -ls [j+1]; ls [i*2] = ls [i*2] -ls [j+1]; } // 내부 계층의 첫 번째 숫자를 최소 루프로 유지합니다. (ls [lent-i*2-1] <ls [lent-j-1]) {ls [lent-i*2-1] = ls [lent-i*2-1]+ls [lent-J-1]; ls [lent-j-1] = ls [lent-i*2-1] -ls [lent-J-1]; ls [lent-i*2-1] = ls [lent-J-1]; } //// (ls [lent-2-i*2] <ls [lent-j-1]) {ls [lent-2-i*2] = ls [lent-2-i*2]+ls [lent-J-1]; ls [lent-j-1] = ls [lent-2-i*2] -ls [lent-J-1]; ls [lent-2-i*2] = ls [lent-J-1]; ls [lent-2-i*2] = ls [lent-J-1]; ls [lent-2-i*2] = ls [lent-J-1]; } // 마지막 if (ls [i*2+1]> ls [j+1]) {ls [i*2+1] = ls [i*2+1]+ls [j+1]; ls [j+1] = ls [i*2+1] -ls [j+1]; ls [i*2+1] = ls [i*2+1] -ls [j+1]; }//다음}}