gmleegmlee
- 浏览: 116748 次
- 性别:
- 来自: 上海
-
最新评论
-
wayswssb：
不好意思 看错了 应该是正确的。。。
Java实现 希尔排序 -
wayswssb：
这算法有问题 感觉 为什么每次都拿temp比较呢
Java实现 希尔排序 -
陈修恒：
最近也碰到这个问题了， 好纠结啊 ..
java.net.SocketException: No buffer space available (maximum connections reached -
bo_hai：
找到了我想要学习的知识点。有java实现算法和用C实现是有所不 ...
java 实现 插入排序 希尔排序 冒泡排序 快速排序 堆排序 归并排序 【完美版】 -
ahutzh：
学习一下
java多线程 银行取款
文章列表
package net.okren.java;
class SaleTicket implements Runnable{
private int tickets = 100;
public void run(){
while(tickets > 0){
sale();
}
}
private synchronized void sale(){
if(tickets > 0){
System.out.println(Thread.currentThread().getName() + "卖出 第 "+ ...
- 2009-09-19 09:56
- 浏览 2201
- 评论(0)
package net.okren.java;
import java.io.*;
//账户
class Account{
private float balance = 1000;
public float getBalance(){
return balance;
}
public void setBalance(float balance){
this.balance = balance;
}
public synchronized void withDraw(float money){
if(balance >= ...
- 2009-09-19 09:22
- 浏览 5245
- 评论(1)
package net.okren.java;
import java.util.*;
import java.io.*;
public class SortTest{
//插入排序;
public static void insertionSort(Comparable[] data){
System.out.println("insertSort() ...");
int j;
for(int p = 1; p < data.length; p++){
Comparable temp = data[p];
f ...
- 2009-09-18 16:23
- 浏览 1763
- 评论(1)
package net.okren.java.sort;
import java.util.*;
public class ShellSort {
public static void shellSort(Comparable[] data){
int j;
for(int gap = data.length / 2; gap > 0; gap /= 2){
for(int i = gap; i < data.length; i++){
Comparable temp = data[i];
for(j = i; j >= g ...
- 2009-09-16 20:46
- 浏览 2407
- 评论(2)
package net.okren.java.sort;
import java.util.*;
public class InsertSort {
public static void insertSort(Comparable[] data){
int j;
for(int p = 1; p < data.length; p++){
Comparable temp = data[p];
for(j = p; j > 0 && temp.compareTo(data[j - 1]) < 0; j--){
...
- 2009-09-16 20:07
- 浏览 754
- 评论(0)
import java.util.Locale;
public class LocaleList {
public static void main(String[] args){
Locale[] localeList = Locale.getAvailableLocales();
for(int i = 0; i < localeList.length; i++){
System.out.println(localeList[i].getDisplayCountry() +
" = "+ localeLis ...
- 2009-06-26 16:17
- 浏览 1329
- 评论(0)
需要：cos.jar，
<%@ page contentType="text/html;charset=GBK" import="java.io.*,java.util.*"%>
<%@ page import="com.oreilly.servlet.multipart.*,com.oreilly.servlet.*"%>
<%
//设置POST请求的内容最大字节为10M,该类用于解析HTTP请求
MultipartParser mp = new MultipartParser(requ ...
- 2009-06-04 21:48
- 浏览 1299
- 评论(0)
需要下载：commons-fileupload-1.2.1-bin.zip commons-io-1.4-bin.zip
http://apache.etoak.com/commons/fileupload/binaries/
http://apache.etoak.com/commons/io/binaries/
<%@ page contentType="text/html;charset=GBK" import="java.io.*,java.util.*"%>
<%@ page import="org.ap ...
- 2009-06-04 21:14
- 浏览 1463
- 评论(0)
<%@ page contentType="text/html; charset=gbk" import="java.io.*"%>
<% /*
InputStream is = request.getInputStream();
BufferedReader bf = new BufferedReader(new InputStreamReader(is));
String buffer = null;
while((buffer = bf.readLine()) != null){
...
- 2009-06-04 20:07
- 浏览 950
- 评论(0)
MyEclipse/Eclipse的内存优化与内存不足的解决办法
做项目的时候，MyEclipse提示内存不足，我本本内存1G的呀。
错误提示大概如下:
MyEclipse has detected that less than 5% of the 64MB of Perm
Gen (Non-heap memory) space remains. It is strongly recommended
that you exit and restart MyEclipse with new virtual machine memory
paramters to increase t ...
- 2009-06-01 21:04
- 浏览 1775
- 评论(0)
public class QuickSelect {
private static Comparable median3(Comparable[] data , int left, int right){
int center = (left + right) /2 ;
if(data[center].compareTo(data[left]) < 0)
swapReferences(data, left, center);
if(data[right].compareTo(data[left]) < 0)
swapReferenc ...
- 2009-05-12 16:43
- 浏览 9224
- 评论(0)
public class QuickSort {
private static Comparable median3(Comparable[] data, int left, int right){
int center = (left + right) / 2;
if(data[center].compareTo(data[left]) < 0)
swapReferences(data, left ,center);
if(data[right].compareTo(data[left]) < 0)
swapReferen ...
- 2009-05-12 15:16
- 浏览 2430
- 评论(0)
public class MergeSort {
private static void mergeSort(Comparable[] data,Comparable[] tmpArray, int left, int right){
if(left < right){
int center = (left + right) / 2;
mergeSort(data, tmpArray, left, center);
mergeSort(data, tmpArray, center + 1, right);
merge(data, tm ...
- 2009-05-12 10:40
- 浏览 1884
- 评论(1)
public class HeapSort2 {
private static int leftChild(int i){
return 2 * i + 1;
}
private static void shiftDown(Comparable[] data,int i, int n){
int child;
Comparable tmp;
for( tmp = data[i]; leftChild(i) < n; i = child ){
child = leftChild(i);
if(child != n-1 ...
- 2009-05-12 09:32
- 浏览 1248
- 评论(0)
public class HeapSort {
private static int leftChild(int i){
return 2 * i + 1;
}
private static void percDown(Comparable[] data, int i, int n){
int child;
Comparable tmp;
for(tmp = data[i]; leftChild(i) < n; i = child){
child = leftChild(i);
if(child != n - 1 &am ...
- 2009-05-11 21:47
- 浏览 1714
- 评论(0)