数组高级
冒泡排序
代码实现:(最大值先出现)
public class maopao {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr={12,34,5,69,28};
bubbleSort(arr);
print(arr);
}
public static void print(int[] arr) {
// TODO Auto-generated method stub
for(int i=0; i<arr.length;i++)
System.out.println(arr[i]);
}
public static void bubbleSort(int[] arr) {
// TODO Auto-generated method stub
for(int i=0; i<arr.length-1 ; i++)
{
for(int j=0; j<arr.length-1-i; j++)
{
if(arr[j]>arr[j+1])
{
int temp= arr[j];
arr[j] =arr[j+1];
arr[j+1]= temp;
}
}
}
}
}
数组高级
选择排序
代码实现:(最小值先出现)
如果某些方法只针对本类中使用,可以将此类私有化privat
package test1;
public class maopao {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr={12,34,5,69,28};
bubbleSort(arr);
print(arr);
selectcSort(arr);
print(arr);
}
public static void selectcSort(int[] arr) {
// TODO Auto-generated method stub
for(int i=0;i < arr.length-1;i++)
{
for(int j=i+1; j<arr.length; j++)
{
if(arr[i]> arr[j])
{
//优化代码
swap(arr,i,j);
/*int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;*/
}
}
}
}
public static void swap(int[] arr,int i,int j) {
// TODO Auto-generated method stub
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
public static void print(int[] arr) {
// TODO Auto-generated method stub
for(int i=0; i<arr.length;i++)
System.out.println(arr[i]);
}
public static void bubbleSort(int[] arr) {
// TODO Auto-generated method stub
for(int i=0; i<arr.length-1 ; i++)
{
for(int j=0; j<arr.length-1-i; j++)
{
if(arr[j]>arr[j+1])
{
swap(arr,j,j+1);
//优化代码
/*int temp= arr[j];
arr[j] =arr[j+1];
arr[j+1]= temp;*/
}
}
}
}
}
数组高级
二分查找
代码实现:
package test1;
//此方法使用时数组必须是有序的
public class erfenchazhao {
public static void main(String[] args) {
// TODO Auto-generated method stub
int[] arr={11,22,33,44,66};
System.out.println(getIndex(arr,22));
System.out.println(getIndex(arr,66));
System.out.println(getIndex(arr,88));
}
public static int getIndex(int[] arr,int value)
{
int min = 0;
int max = arr.length -1;
int mid = (min + max ) / 2;
while( arr[mid] != value )
{
if( arr[mid] < value )
min= mid+1;
else if( arr[mid] > value )
max= mid-1;
mid=(min+max)/2;
if(min>max)
return -1;
}
return mid;
}
}