js冒泡排序

          var element = [8, 10, 6, 7, 9, 5, 3, 2, 1, 4];
                            function compare(element) {
                                for (var i = 0; i < element.length - 1; i++) {
                                    for (var j = 0; j < element.length - i - 1; j++) {
                                        if (element[j] > element[j + 1]) {
                                            var swap = element[j];
                                            element[j] = element[j + 1];
                                            element[j + 1] = swap;
                                        }
                                    }
                                }
                            }
                            console.log('before' + element);
                            compare(element);
                            console.log('after' + element);

你可能感兴趣的:(js冒泡排序)