|
@@ -0,0 +1,75 @@
|
|
|
+package com.sf.leetcode;
|
|
|
+
|
|
|
+import java.util.Arrays;
|
|
|
+
|
|
|
+public class Solution_912 {
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+ public static int[] selectionSort(int[] nums) {
|
|
|
+ for (int i = 0; i < nums.length; i++) {
|
|
|
+
|
|
|
+ int min = i;
|
|
|
+ for (int j = i + 1; j < nums.length; j++) {
|
|
|
+ if (nums[j] < nums[min]) {
|
|
|
+ min = j;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ if (min != i) {
|
|
|
+ int temp = nums[min];
|
|
|
+ nums[min] = nums[i];
|
|
|
+ nums[i] = temp;
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+ return nums;
|
|
|
+ }
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+ public static int[] insertionSort(int[] nums) {
|
|
|
+ for (int i = 1; i < nums.length; i++) {
|
|
|
+
|
|
|
+ for (int j = i; j > 0; j--) {
|
|
|
+
|
|
|
+ if (nums[j] > nums[j - 1]) break;
|
|
|
+ int temp = nums[j];
|
|
|
+ nums[j] = nums[j - 1];
|
|
|
+ nums[j - 1] = temp;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ return nums;
|
|
|
+ }
|
|
|
+
|
|
|
+
|
|
|
+
|
|
|
+ public static int[] bubbleSort(int[] nums) {
|
|
|
+ for (int i = 0; i < nums.length - 1; i++) {
|
|
|
+ for (int j = 0; j < nums.length - 1 - i; j++) {
|
|
|
+
|
|
|
+ if (nums[j] > nums[j + 1]) {
|
|
|
+ int temp = nums[j];
|
|
|
+ nums[j] = nums[j + 1];
|
|
|
+ nums[j + 1] = temp;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+ return nums;
|
|
|
+ }
|
|
|
+
|
|
|
+ public static void main(String[] args) {
|
|
|
+ int[] nums = new int[]{3, 4, 5, 2, 1, 6, 7, 8, 9};
|
|
|
+
|
|
|
+
|
|
|
+ bubbleSort(nums);
|
|
|
+ System.out.println(Arrays.toString(nums));
|
|
|
+ }
|
|
|
+}
|