随机数组归并问题

布满荆棘的人生 2024-03-16 16:49 31阅读 0赞

**1** **问题**

![0f8f01cc34927ac364166d740a381773.png][]生成两个任意的随机数组，并将这两个数组按照数字大小按顺序归并到一个新数组中。

**2** **方法**

思路：定义三个数组，两个数组自己输入值，第三个数组用来作归并后的数组，先将两个数组的值全部赋给第三个数组，然后将其进行排序输出。

（1）先定义三个数组

![c8b30914e98941a08cb93b828ba137b1.png][]

（2）给两个数组赋值

![de26fd2fe3750daae7fb037d346f7442.png][]

（3）给新数组赋值

![c7619a23c55d210918a9919842fe03ef.png][]

（4）给新数组排序，并输出最终结果

![464978f8fca101828807d10bb7b88f94.png][]

<table> 
 <tbody> 
 <tr> 
 <td>package Practice1; import java.util.Arrays; import java.util.Random; import java.util.Scanner; public class Practice2{ &nbsp; &nbsp;public static void main(String[] args) { &nbsp; &nbsp; &nbsp; &nbsp;int[] arr1=new int[5]; &nbsp; &nbsp; &nbsp; &nbsp;int[] arr2=new int[5]; &nbsp; &nbsp; &nbsp; &nbsp;int[] New=new int[10]; &nbsp; &nbsp; &nbsp; &nbsp;Scanner scanner=new Scanner(System.in); &nbsp; &nbsp; &nbsp; &nbsp;System.out.print("请给第一个数组赋值，最多"+arr1.length+"个,以空格隔开："); &nbsp; &nbsp; &nbsp; &nbsp;for(int i=0;i&lt;arr1.length;i++) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr1[i]=scanner.nextInt(); &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp;System.out.println("第一个数组："+Arrays.toString(arr1)); &nbsp; &nbsp; &nbsp; System.out.println("-------------------------------------------------"); &nbsp; &nbsp; &nbsp; &nbsp;System.out.print("请给第二个数组赋值，最多"+arr2.length+"个,以空格隔开："); &nbsp; &nbsp; &nbsp; &nbsp;for(int i=0;i&lt;arr2.length;i++) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;arr2[i]=scanner.nextInt(); &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp;System.out.println("第二个数组："+Arrays.toString(arr2)); &nbsp; &nbsp; &nbsp; System.out.println("-------------------------------------------------"); &nbsp; &nbsp; &nbsp; &nbsp;for(int i=0;i&lt;New.length;i++) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(i&lt;arr1.length) &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;New[i]=arr1[i]; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(i&gt;=arr1.length) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;New[i]=arr2[i-5]; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp;for(int i=0;i&lt;New.length-1;i++) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;for(int j=0;j&lt;New.length-1-i;j++) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;if(New[j]&gt;New[j+1]) { &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;int tmp=New[j]; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;New[j]=New[j+1]; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;New[j+1]=tmp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp;} &nbsp; &nbsp; &nbsp; &nbsp;//输出最终结果数组 &nbsp; &nbsp; &nbsp; &nbsp;System.out.println("排序后的新数组："+Arrays.toString(New)); &nbsp; &nbsp;} }</td> 
 </tr> 
 </tbody> 
</table>

**3** **结语**

针对随机数组归并问题，提出冒泡排序方法。通过本次实验，证明该方法是有效的，除了本文的方法外还可使用递归来解决此问题。

[0f8f01cc34927ac364166d740a381773.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/16/9c1e4d13dbd24e288f2f026c07fd888f.png
[c8b30914e98941a08cb93b828ba137b1.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/16/b89e7f46389f4559a2c0d1d651916e4f.png
[de26fd2fe3750daae7fb037d346f7442.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/16/05ebbdb6b6734c7fa34a93d726faa0de.png
[c7619a23c55d210918a9919842fe03ef.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/16/cdbc95e1e2a94510a40794b176509b94.png
[464978f8fca101828807d10bb7b88f94.png]: https://image.dandelioncloud.cn/pgy_files/images/2024/03/16/deabdfb2fdf645af9daa200ffc541f97.png