/*
* 数组倒序
* 返回值void
* 传递参数 int[] arr
* */
public static void reverseArray(int[] arr){
for(int i = 0 ;i < arr.length / 2 ;i++){
int temp = arr[i];
arr[i] = arr[arr.length-1-i];
arr[arr.length-1-i] = temp;
}
}
3.数据交换
//数据交换
public static void swap(int[] arr,int a,int b)
{
int temp = arr[a];
arr[a]=arr[b];
arr[b]=temp;
}
4.//选择排序
public static void xuanze(int[] arr)
{
for(int i=0;i<arr.length;i++)
{
for(int j=i;j<arr.length;j++)
{
if(arr[i]>arr[j])
{
swap(arr,i,j);
}
}
}
}
5./**
* 有一个已经排序号的数组。现在输入一个数,要求按原来的规律将它插入数组中。
*/
import java.util.Scanner;
public class ArrDemo4 {
public static void main(String[] args)
{
int [] a = new int [] {1,2,6,14,25,36,37,55};
System.out.println("排序之前的:");
System.out.print("{");
for(int i=0;i<a.length;i++)
{
if(i==a.length-1){
System.out.print(a[i]+"}");
}else{
System.out.print(a[i]+",");
}
}
System.out.print("\n");
int [] b = new int [a.length+1];
int t1=0,t2=0;
int i = 0;
Scanner s = new Scanner(System.in);
System.out.println("请输入一个正数:");
int num = s.nextInt();
if(num >=a[a.length-1])
{
b[b.length-1] =num;
for (i = 0; i < a.length; i++) {
b[i]=a[i];
}
}else{
for (i = 0; i < a.length; i++)
{
if(num>=a[i])
{
b[i]=a[i];
}else
{
b[i]=num;
break;
}
}
for (int j = i+1; j < b.length; j++)
{
b[j]=a[j-1];
}
System.out.println("排序之后的:");
System.out.print("{");
for(i=0;i<b.length;i++)
{
if(i==b.length-1){
System.out.print(b[i]+"}");
}else{
System.out.print(b[i]+",");
}
}
}
}
}
2.数组的冒泡排序
int arr[]={1,3333,44,444,5,555,55,555};
for(int j=0;j<arr.length;j++){
for(int i=0;i<arr.length-j-1;i++){
if(arr[i]>arr[i+1]){
int temp=arr[i+1];
arr[i+1]=arr[i];
arr[i]=temp;
}
}
}
1.打印输出一个数组
int arr[]={1,2,3,4,5,6,7};
System.out.print("{");
for(int i=0;i<arr.length;i++)
{
if(i==arr.length-1){
System.out.print(arr[i]+"}");
}else{
System.out.print(arr[i]+",");
}
}