具有冒泡排序的阵列

Question

我的任务是使用Bubble Sort算法对数组进行排序（我的成绩（int）是），并且我已经完成了这个任务。

但我还希望它从另一个数组中打印出包含以相同顺序的每个年级的以下名称的名称。

我该怎么做？

package assignment9.pkg1; 

import java.util.Scanner; 

/** 
* 
* @author Anders 
*/ 
public class Assignment91 { 

/** 
* @param args the command line arguments 
*/ 
public static void main(String[] args) { 

    String studName = "Anders"; 
    int counter = 3; 
    System.out.println(" welcome to student database, show informations about student" + studName); 

    Scanner courseScan = new Scanner(System.in); 
    Scanner gradeScan = new Scanner(System.in); 
    Scanner counterScan = new Scanner(System.in); 

    System.out.println(" Enter the number of courses"); 

    String[] courseArray = new String[counter]; 
    int[] gradeArray = new int[counter]; 

    for (int k = 0; k < counter; k++) { 

     if (20 < counter) { 

      System.out.println(" no more space"); 
     } else { 

      System.out.println(" enter name"); 
      courseArray[k] = courseScan.nextLine(); 
      System.out.println(" Enter grade"); 
      gradeArray[k] = gradeScan.nextInt(); 
     } 
    } 

    int n = gradeArray.length; 
    int temp = 0; 

    for (int i = 0; i < n; i++) { 
     for (int j = 1; j < (n - i); j++) { 

      if (gradeArray[j - 1] > gradeArray[j]) { 
       //swap the elements! 
       temp = gradeArray[j - 1]; 
       gradeArray[j - 1] = gradeArray[j]; 
       gradeArray[j] = temp; 

      } 

     } 

    } 

    for (int l = 0; l < counter; l++) { 

     System.out.println(gradeArray[l] + courseArray[l]); 
    } 
} 
} 

环路

Answer 1

在修改过的等级顺序修改当然阵列的顺序，也

for (int i = 0; i < n; i++) { 
    for (int j = 1; j < (n - i); j++) { 

     if (gradeArray[j - 1] > gradeArray[j]) { 
      //swap the elements! 
      temp = gradeArray[j - 1]; 
      gradeArray[j - 1] = gradeArray[j]; 
      gradeArray[j] = temp; 

      //swap the course name ! 
      String stringTemp; 
      stringTemp = courseArray[j - 1]; 
      courseArray[j - 1] = courseArray[j]; 
      courseArray[j] = stringTemp; 

     } 

    } 

}