Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

Java Arrays.sort Ô´Âë½âÎö primitive

    Java ArraysÖÐÌṩÁ˶ÔËùÓÐÀàÐ͵ÄÅÅÐò¡£ÆäÖÐÖ÷Òª·ÖΪprimitiveºÍObjectÁ½´óÀ࣬·Ö±ðʹÓÃÁË¿ìËÙÅÅÐòÓëºÏ²¢ÅÅÐò¡£±¾ÕÂÒÔint[] µÄÅÅÐò£¬½²½âJava¶ÔprimitiveÅÅÐò¡£
    Ê×ÏÈ´ó¼ÒÒªÁ˽âʲôÊÇ¿ìËÙÅÅÐò£¬ËüÓÐʲôÓŵ㣬ÕâЩÎҾͲ»ÀÛÊöÁË£¬¸ø³öµØÖ·¡£http://zh.wikipedia.org/zh/%E5%BF%AB%E9%80%9F%E6%8E%92%E5%BA%8F
ÔÚÁ˽âÁË»ù±¾Ô­ÀíÖ®ºó£¬ÉÏͼ¿ÉÒÔ¶¯Ì¬µÄչʾ¿ìËÙÅÅÐòµÄ»ù±¾Ë¼Â·¡£ºÜ¾­µä~
½ÓÏÂÀ´£¬ÎÒÃÇչʾԴÂ룬²¢×Ðϸ½²½â£¡
public static void sort(int[] a) {
sort1(a, 0, a.length);
}

Õâ¸ö·½·¨ÊǶÔÍⱩ¶µÄµ÷Óýӿڡ£ sort1 ÊÇÅÅÐò·½·¨µÄÖ÷Ì壬´«Èë²ÎÊý·Ö±ðΪ£º´ýÅÅÐòÊý×飬ÅÅÐòÆðʼλÖ㬴ýÅÅÐòÔªËØ³¤¶È¡£
sort1ÖÐʹÓõ½ÁíÍâ3¸ö·½·¨£¬Ê×ÏȽéÉÜ¡£
1. swap£º¼òµ¥µÄʹÓÃÖмä±äÁ¿À´½»»»Êý×éÄÚÔªËØ¡£
private static void swap(int x[], int a, int b) {
int t = x[a];
x[a] = x[b];
x[b] = t;
}

2.med3£º¼ÆËãÖÐÖµ¡£
private static int med3(int x[], int a, int b, int c) {
return (x[a] < x[b] ?
(x[b] < x[c] ? b : x[a] < x[c] ? c : a) :
(x[b] > x[c] ? b : x[a] > x[c] ? c : a));
}

3.vecswap£ºÅúÁ¿Òƶ¯ÔªËØ
private static void vecswap(int x[], int a, int b, int n) {
for (int i=0; i<n; i++, a++, b++)
swap(x, a, b);
}

Íòʾ㱸£¬¿ªÊ¼Ïê½â¡£
private static void sort1(int x[], int off, int len) {
// Insertion sort on smallest arrays
if (len < 7) {
for (int i=off; i<len+off; i++)
for (int j=i; j>off && x[j-1]>x[j]; j--)
swap(x, j, j-1);
return;
}

¿ªÍ·²¿·Ö±ãÅжϣ¬Èç¹ûÊý×鳤¶ÈСÓÚ7£¬±ãʹÓòåÈë·½·¨ÅÅÐò¡£
// Choose a partition element, v
int m = off + (len >> 1); // Small arrays, middle element
if (len > 7) {
int l = off;
int n = off + len - 1;
if (len > 40) { // Big arrays, pseudomedian of 9
int s = len/8;
l = med3(x, l, l+s, l+2*s);
m = med3(x, m-s, m, m+s);
n = med3(x, n-2*s, n-s, n);
}
m = med3(x, l, m, n); // Mid-size, med of 3
}
int v = x[m];

Èç¹û³¤¶È½Ï³¤£¬±ãÐ


Ïà¹ØÎĵµ£º

javaС֪ʶ

(1)JavaÖеÄÖ÷·½·¨public static void main(String args[])ΪʲôҪÓÃstaticÀ´ÐÞÊÎ
ÒòΪjavaÊÇÍêÈ«ÃæÏò¶ÔÏóÓïÑÔ,Õâ¸öÖ÷º¯ÊýÆäʵÊÇÒ»¸öÀàµÄ·½·¨,Õâ¸ö·½·¨ÔÚÀàûÓÐÉú³É¶ÔÏóµÄʱºò¾Í±ØÐë±»JVMµ÷ÓÃ,ËùÒÔËü±ØÐëÊǾ²Ì¬µÄ³ÉÔ±º¯Êý.
 £¨2£©javaÓïÑÔÖеÄpublic static void main(String[] args) ×÷ÓÃÊÇʲô.Ëù×öµÄÊÂÇéÓÖÊÇʲ ......

×îСÉú³ÉÊ÷ PrimËã·¨ java´úÂëʵÏÖ

 /*
*ÈÕÆÚ:2010-04-18 11:37
*¿ª·¢Õß:heroyan
*ÁªÏµ·½Ê½:zndxysf@126.com
*¹¦ÄÜ:ÎÞÏòͼ×îСÉú³ÉÊ÷PrimË㷨ʵÏÖ°¸Àý
*/
import java.util.Scanner;
import java.util.Arrays;
import java.util.ArrayList;
public class SpanningTree{
private static int MAX = 100;
private double cost[][] = new doubl ......

Javaѧϰ±Ê¼Ç

1.staticÉùÃ÷±äÁ¿µÄÓ÷¨ÔÚ»ù´¡ÖªÊ¶ÀïÃæ£»
    JavaÀïÃæstaticÓÃÀ´ÉùÃ÷º¯ÊýµÄ×÷Óãº
      A.¿ÉÒÔ²»Óô´½¨¶ÔÏó£¨ÊµÀý£©£¬¶øÖ±½Óµ÷Ó×—Àà.·½·¨
      B.ÓÃÓÚmainº¯ÊýµÄ·½·¨
2.new——·ÖÅä¿Õ¼äÎÊÌâ
    ÓжàÉÙne ......

4.19 java programming

/////////////////////DogTestDrive/////////////////////
class DogTestDrive {
 public static void main(String[] args) {
  Dog one = new Dog();
     one.size = 70;
     Dog two = new Dog();
     two.size = 8;
   ......

java»ù´¡ÃæÊÔÌâ×ܽá

1.¾Ö²¿±äÁ¿ÔÚʹÓõÄʱºò±ØÐëÒѾ­±»³õʼ»¯
2.byte b=2,e=3
   byte c=b+c;   »á±àÒ벻ͨ¹ý£¬Ó¦Îªb+c»á×Ô¶¯ ÀàÐÍÌáÉýλint Èç¹ûÏëµÃµ½ byte c ±ØÐëÇ¿ÖÆ×ªÐÍ        byte c=(byte)b+c;         
3.f ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ