データ構造とアルゴリズム論

Size: px

Start display at page:

Download "データ構造とアルゴリズム論"

りえあわたけ
5 years ago
Views:

1 A[0]A[4] A 1,2,3,4,5 5,4,3,2,1 87

2 A A[0]A[1] A[1]A[2] A[2]A[3] A[3]A[4] A[4] A[0]A[1] A[1]A[2] A[2]A[3] A[3] A[0]A[1] A[1]A[2] A[2] A[0]A[1] A[1],A[0] 88

3 A[0]A[n-1] in-1,-1,1 j0,1,i-1 n-1,n-2,,1 A[j]A[j+1] Yes Temp A[j] A[j] A[j+1] A[j+1] Temp No A[j]A[j+1] 89

15 11 18 6-1 HP tokuten.txt IOFile tokuten.

4 HP tokuten.txt IOFile tokuten.txt jbuttonread jlabelread jbuttondisplay jbuttonbubblesort jtextarea1 jlabelsort UI jfilechooser tokuten.txt 90

5 jtextarea1 91

6 import java.awt.*; import java.awt.event.*; import javax.swing.*; import java.io.*; int Tokuten[]= new int[100]; // int Num; // void jbuttonread actionperformed(actionevent e) { String Data; try { jfilechooser1.showopendialog(this); File FName=jFileChooser1.getSelectedFile(); BufferedReader fin=new BufferedReader(new FileReader(FName)); int i=0; while ((Data=fin.readLine())!=null) { Tokuten[i]=Integer.parseInt(Data); i++; Num=i; jlabelread.settext(" "); fin.close(); catch (Exception em) { jlabelread.settext(" "+em); 3-7 void jbuttondisplay actionperformed(actionevent e) { String Data=""; for (int i=0;i<num;i++) { Data=Data+Tokuten[i]+" n"; jtextarea1.settext(data); 92

7 p.89 void jbuttonbubblesort actionperformed(actionevent e) { int Temp; for (int i=num-1; i>=1 ;i--) { for (int j=0; j<=i-1 ;j++) { if(tokuten[j]>tokuten[j+1]) { Temp=Tokuten[j]; Tokuten[j]=Tokuten[j+1]; Tokuten[j+1]=Temp; jlabelsort.settext(" "); 93

8 HP BubbleSort.exe BubbleSort.exe 5 5,4,3,2,1 94

9 A[0]A[4]

10 A A[0]A[4] A[3] A[0]A[3] A[0] A[1]A[4] A[4] A[1]A[4] A[1] A[2]A[4] A[4] A[2]A[4] A[2] A[3]A[4] A[4] A[3]A[4] A[3] A[4] 96

11 A[0]A[n-1] i0,1,n-2 Min i Min ji+1,1,n-1 A[j]A[Min] No Yes Min j Min Temp A[i] A[i] A [M in] A[Min] Temp A[i]A[Min] 97

12 A[0]A[n-1] 98

13 tokuten.txt 6-2 jbuttonsentakusort void jbuttonsentakusort actionperformed(actionevent e) { int Temp,Min; for (int i=0;i<=num-2;i++) { Min=i; for (int j=i+1; j<=num-1;j++) { if(tokuten[j]< Tokuten[Min] ) { Min=j; Temp=Tokuten[i]; Tokuten[i]=Tokuten[Min]; Tokuten[Min] = Temp; jlabelsort.settext(" "); 6-5 HP SentakuSort.exe SentakuSort.exe 99

14 A A[0] A[1] A[1]A[0]A[1] A[0]>A[1] A[0] A[1] A[2] A[2]A[0]A[2] A[2]A[1]A[0] A[0]A[2] A[3] A[3]A[0]A[3] A[3]A[2]A[1] A[1]<9 A[0]A[3] A[4] A[4]A[0]A[4] A[0]A[4] 100

15 A[0]A[n-1] i0, 1, n- 2 A[0]A[i] Temp A [ j- 1] A[j-1] A[j] A[j] j i+1 j0 A[j-1] A [j] A[j] Temp j A[i+1]A[0]A[i+1] A[j-1]A[j] A[j-1] A[j] j j-1 while whilej1 A[j-1]A[j]

16 tokuten.txt 6-4 jbuttonsounyusort void jbuttonsounyusort actionperformed(actionevent e) { int Temp; for ( int i=0;i<=num-2;i++j=i+1; { int whi le ( j>=1 && Tokuten[j-1]>Tokuten[j] ) { Temp=Tokuten[j-1]; Tokuten[j-1]=Tokuten[j]; Tokuten[j]=Temp; j--; jlabelsort.settext(" "); 102

17 HP SounyuSort.exe n(n-1)/2 n(n-1)/2 103

18 A score3.txt 59 5-B 3 104

データ構造とアルゴリズム論

データ構造とアルゴリズム論 15 11 11 Java 21 231-0811 32 152-0033 1 Java 3-5,55,63,39,87,48,70,35,77,59,44 3-5 3-7 score2.txt 75 15 11 11 5-1 3-7 jbuttonread jbuttondisplay jlabelmessage jtextfieldname jtextfieldtokuten