front_end_code_snippet 记录我的前端代码段 基本排序算法 简易排序 bunbleSort ( originalArray ) { if ( originalArray . length <= 1 ) { return originalArray ; } for ( let i = 1 ; i < originalArray xss=removed xss=removed xss=removed> originalArray [ j + 1 ] ) {