Groups
Groups
Sign in
Groups
Groups
EnJoyJava
Conversations
About
Send feedback
Help
for - <很急!!>Java程式高手拜託幫忙解題<20點!!>
5 views
Skip to first unread message
q738...@yahoo.com.tw
unread,
Jan 5, 2011, 2:19:45 AM
1/5/11
Reply to author
Sign in to reply to author
Forward
Sign in to forward
Delete
You do not have permission to delete messages in this group
Copy link
Report message
Show original message
Either email addresses are anonymous for this group or you need the view member email addresses permission to view the original message
to EnJoyJava
import java.util.*;
public class twoarysort {
static int temp = 0;
public static void main(String[] args) {
int[][] numbers = new int[2][20];
Scanner in = new Scanner(System.in);
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 20; j++) {
System.out.printf("請輸入%d個陣列的第%d個數", i + 1, j + 1);
int keyin = in.nextInt();
numbers[i][j] = keyin;
}
}
System.out.println("合併後陣列元素");
int[] k = arysort(numbers);
for (int ss : k)
System.out.print(ss + " ");
}
public static int[] arysort(int[][] ary) {
int[] nary = new int[40];
int k = 0;
for (int i = 0; i < 2; i++) {
for (int j = 0; j < 20; j++) {
nary[k] = ary[i][j];
k++;
}
}
return insertion(nary);
}
public static int[] insertion(int[] number) {
for (int j = 1; j < number.length; j++) {
int tmp = number[j];
int i = j - 1;
while (i != -1 && tmp < number[i]) {
number[i + 1] = number[i];
i--;
}
number[i + 1] = tmp;
}
return number;
}
}
Reply all
Reply to author
Forward
0 new messages