New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

选择排序 #31

Open

lovelmh13 opened this issue Feb 7, 2020 · 0 comments

Owner

lovelmh13 commented Feb 7, 2020

每次找出最大或者最小的，放到前面。

function bubbleSort0(arr) {
	for (let i = 0; i < arr.length - 1; i++) {
		for (let j = i + 1; j < arr.length; j++) {
			if (arr[i] > arr[j]) {
				[arr[i], arr[j]] = [arr[j], arr[i]]
			}
		}
	}
}

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment