package com.company;

import java.util.Arrays;
import java.util.Random;

/**
 * @author Du Shun Chang
 * @version 1.0
 * @date 2021/9/7 22:48
 * @Todo: 1.隨機(jī)產(chǎn)生兩個(gè)數(shù)組，并進(jìn)行兩個(gè)數(shù)組的排序。2.排序好的數(shù)組，進(jìn)行排序合并
 * @QQ:1300442386
 */
public class Mian {
    public static void main(String[] args) {
        
//初始化兩個(gè)長度為10的數(shù)組
        Random random = new Random();
        int[] a = new int[10];
        int[] b = new int[10];
//隨機(jī)生成1000以內(nèi)的數(shù)，并賦值到數(shù)組中
        for (int i = 0; i < 10; i++) {
            a[i] = random.nextInt(1000);
            b[i] = random.nextInt(1000);
        }
        System.out.println("隨機(jī)產(chǎn)生數(shù)組A：" + Arrays.toString(a));
        System.out.println("隨機(jī)產(chǎn)生數(shù)組B：" + Arrays.toString(b));
        int temp = 0;
//重新排序隨機(jī)數(shù)組A
        for (int i = 0; i < 10; i++) {
            for (int j = i; j < 10; j++) {
                if (a[i] >= a[j]) {
                    // 定義中間變量值
                    temp = a[i];
                    // 換位賦值
                    a[i] = a[j];
                    // 獲得新位置
                    a[j] = temp;
                }
            }
        }
        System.out.println("排序后的數(shù)組A：" + Arrays.toString(a));
//重新排序隨機(jī)數(shù)組B
        for (int i = 0; i < 10; i++) {
            for (int j = i; j < 10; j++) {
                if (b[i] >= b[j]) {
                    // 定義中間變量值
                    temp = b[i];
                    // 換位賦值
                    b[i] = b[j];
                    // 獲得新位置
                    b[j] = temp;
                }
            }
        }
        System.out.println("排序后的數(shù)組B：" + Arrays.toString(b));
//對新的數(shù)組進(jìn)行合并及進(jìn)行排序
        int l = a.length + b.length;
        int[] temps = new int[l];
        int i = 0, j = 0, h = 0;
        while (i < a.length || j < b.length) {
            if (i == a.length && j < b.length) {
                temps[h++] = b[j++];
            } else if (i < a.length && j == b.length) {
                temps[h++] = a[i++];
            } else if (a[i] <= b[j]) {
                temps[h++] = a[i++];
            } else if (a[i] > b[j]) {
                temps[h++] = b[j++];
            }
        }
        System.out.print("排序后最新數(shù)組：" + Arrays.toString(temps));
    }
}

/**
 * @author Du Shun Chang
 * @version 1.0
 * @date 2021/9/8 22:48
 * @Todo: 冒泡排序演示
 * @QQ:1300442386
 */
 public class Mian{
    public static void main(String[] args) {
   int[] arr = {6, 3, 8, 2, 9, 1};
        System.out.println("排序前數(shù)組為：" + Arrays.toString(arr));
        for (int s = 0; s < arr.length - 1; s++) {//外層循環(huán)控制排序趟數(shù)
            for (int k = 0; k < arr.length - 1 - s; k++) {//內(nèi)層循環(huán)控制每一趟排序多少次
                if (arr[k] > arr[k + 1]) {
                    int temp1 = arr[k];
                    arr[k] = arr[k + 1];
                    arr[k + 1] = temp1;
                }
            }
        }
        System.out.println("排序后數(shù)組為：" + Arrays.toString(arr));
         }
        }