package qll;
public class BinarySearch {
public static void maoPao(int[] datas) {
for (int i = 0; i < datas.length - 1; i++) {
for (int j = 0; j < datas.length - i - 1; j++) {
if (datas[j] > datas[j + 1]) {
int temp;
temp = datas[j];
datas[j] = datas[j + 1];
datas[j + 1] = temp;
}
}
for (int k = 0; k < datas.length; k++) {
System.out.print(datas[k] + ",");
}
}
}
public static int erFen(int[] datas, int key) {
int index = -1;
int low = 0;
int high = datas.length - 1;
while (low <= high) {
int middle = (low + high) >> 1;
if (key == datas[middle]) {
index = middle;
break;
} else if (key > datas[middle]) {
low = middle + 1;
} else if (key < datas[middle]) {
high = middle - 1;
}
}
System.out.println(index);
return index;
}
public static void main(String[] args) {
int[] array = { 3, 2, 33, 55, 44, 77, 1, 6 };
BinarySearch.maoPao(array);
BinarySearch.erFen(array, 55);
}
}
package qll;
import java.io.File;
public class IODemo {
public static void main(String args[])
{
loop("d://") ;
}
public static void loop(String dir)
{
File f = new File(dir) ;
String str[] = null ;
if(f.isDirectory())
{
str = f.list() ;
for(int i=0;i<str.length;i++)
{
loop(dir+"//"+str[i]) ;
}
}
else
{
System.out.println(dir) ;
}
}
}