Java array sorting and index output: implementing test score sorting table

This document is intended to guide developers on how to sort array elements in Java programs and output the sorted results in tabular form while retaining the original index information. By modifying the existing `selectionSort` method and combining it with the index array, the test results input by the user are sorted and output, ensuring the accuracy and readability of the output results.
Problem analysis
The problem with the original program is that the selectionSort method directly sorts the array elements, causing the correspondence between the elements and the original index to be lost, and the sorted scores cannot be correctly output in the order of "Test 1" and "Test 2". At the same time, when sorting, the program needs to pay attention to sorting only the results actually entered by the user, not the entire array.
solution
In order to solve the above problem, we need the following steps:
- Create an index array: Create an index array with the same size as the original score array, initialized from 0 to scoreCount-1.
- Modify the sorting algorithm: Modify the selectionSort method so that it sorts the index array instead of directly sorting the score array. When comparing grades, use the index array to access the grade array.
- Output the sorted table: When outputting the table, use the sorted index array to access the score array, thereby outputting the scores and corresponding test numbers in the sorted order.
Code implementation
Here is the modified code example:
import java.util.Scanner;
public class ArrayIntro2 {
public static void main(String[] args) {
// integer array
int[] TestGrades = new int[25];
// creating object of ArrayIntro2T
ArrayIntro2T pass = new ArrayIntro2T(TestGrades, 0, 0, 0);
// getting total and filling array
int scoreCount = ArrayIntro2T.FillArray(TestGrades, 0);
//get average score
double avg = pass.ComputeAverage(TestGrades, scoreCount);
//outputting table
ArrayIntro2T.OutputArray(TestGrades, scoreCount, avg);
//outputting sorted table
ArrayIntro2T.OutputSortedArray(TestGrades, scoreCount, avg);
}
}
// new class to store methods
class ArrayIntro2T {
// variable declaration
doubleCalcAvg = 0;
int ScoreTotal = 0;
int ScoreCount = 0;
int[] TestGrades = new int[25];
// constructor
public ArrayIntro2T(int[] TestGradesT, int ScoreCountT, double CalcAvgT, int ScoreTotalT) {
TestGrades = TestGradesT;
ScoreCount = ScoreCountT;
CalcAvg = CalcAvgT;
ScoreTotal = ScoreTotalT;
}
// method to fill array
public static int FillArray(int[] TestGrades, int ScoreCount) {
Scanner scan = new Scanner(System.in);
System.out.println("Please enter test scores one at a time, up to 25 values or enter -1 to quit");
TestGrades[ScoreCount] = scan.nextInt();
if (TestGrades[ScoreCount] == -1) {
System.out.println("You have chosen to quit ");
}
while (TestGrades[ScoreCount] >= 0 && ScoreCount <p> <strong>Code explanation:</strong></p><ol>
<li> <strong>OutputSortedArray method:</strong><ul>
<li> Create the index array indices and initialize it from 0 to scoreCount-1.</li>
<li> Call the selectionSort method and pass in the grade array, index array and number of grades.</li>
<li> Traverse the sorted index array, use TestGrades[indices[i]] to access the grades array, and output the grades and corresponding test numbers in the sorted order.</li>
</ul>
</li>
<li> <strong>selectionSort method:</strong><ul>
<li> Modify the sorting logic so that it sorts the index array.</li>
<li> When comparing grades, use TestGrades[indices[j]] and TestGrades[indices[minIndex]] to access the grade array.</li>
<li> Swap the elements in the index array instead of directly swapping the elements in the grades array.</li>
</ul>
</li>
</ol><h3> Running results</h3><p> The modified program can correctly output the sorted test score table and retain the original test number information.</p><h3> Things to note</h3>
- Ensure that the loop condition and array access method in the selectionSort method are correct to avoid array out-of-bounds errors.
- When outputting the table, use the sorted index array to access the score array to ensure the correct output order.
- The sorting algorithm can be modified according to actual needs, such as using more efficient sorting algorithms (such as quick sort, merge sort) to improve sorting efficiency.
Summarize
By creating an index array and modifying the sorting algorithm, we can sort the array elements in the Java program and output the sorted results in tabular form while retaining the original index information. This method can be applied to various scenarios where data needs to be sorted and the original order preserved.
The above is the detailed content of Java array sorting and index output: implementing test score sorting table. For more information, please follow other related articles on the PHP Chinese website!
Hot AI Tools
Undress AI Tool
Undress images for free
AI Clothes Remover
Online AI tool for removing clothes from photos.
Undresser.AI Undress
AI-powered app for creating realistic nude photos
ArtGPT
AI image generator for creative art from text prompts.
Stock Market GPT
AI powered investment research for smarter decisions
Hot Article
Popular tool
Notepad++7.3.1
Easy-to-use and free code editor
SublimeText3 Chinese version
Chinese version, very easy to use
Zend Studio 13.0.1
Powerful PHP integrated development environment
Dreamweaver CS6
Visual web development tools
SublimeText3 Mac version
God-level code editing software (SublimeText3)
Hot Topics
20518
7
13631
4
How to configure Spark distributed computing environment in Java_Java big data processing
Mar 09, 2026 pm 08:45 PM
Spark cannot run in local mode, ClassNotFoundException: org.apache.spark.sql.SparkSession. This is the most common first step of getting stuck: even the dependencies are not correct. Only spark-core_2.12 is written in Maven, but spark-sql_2.12 is not added. SparkSession crashes as soon as it is built. The Scala version must strictly match the official Spark compiled version - Spark3.4.x uses Scala2.12 by default. If you use spark-sqljar of 2.13, the class loader cannot directly find the main class. Practical advice: Go to mvnre
How to safely map user-entered weekday string to integer value and implement date offset operation in Java
Mar 09, 2026 pm 09:43 PM
This article introduces a concise and maintainable way to map the weekday string (such as "Monday") to the corresponding serial number (1-7), and use the modulo operation to realize the forward and backward offset of any number of days (such as Monday plus 4 days to get Friday), avoiding lengthy if chains and hard-coded logic.
How to generate a list of duplicate elements using Java's Collections.nCopies_Initialization tips
Mar 06, 2026 am 06:24 AM
Collections.nCopies returns an immutable view. Calling add/remove will throw UnsupportedOperationException; it needs to be wrapped with newArrayList() to modify it, and it is disabled for mutable objects.
What is exception masking (Suppressed Exceptions) in Java_Multiple resource shutdown exception handling
Mar 10, 2026 pm 06:57 PM
What is SuppressedException: It is not "swallowed", but actively archived by the JVM. SuppressedException is not an exception loss, but the JVM quietly attaches the secondary exception to the main exception under the premise that "only one exception must be thrown" for you to verify afterwards. It is automatically triggered by the JVM in only two scenarios: one is that the resource closure in try-with-resources fails, and the other is that you manually call addSuppressed() in finally. The key difference is: the former is fully automatic and safe; the latter requires you to keep it to yourself, and it can be written as shadowing if you are not careful. try-
How to use Homebrew to install Java on Mac_A must-have Java tool chain for developers
Mar 09, 2026 pm 09:48 PM
Homebrew installs the latest stable version of openjdk (such as JDK22) by default, not the LTS version; you need to explicitly execute brewinstallopenjdk@17 or brewinstallopenjdk@21 to install the LTS version, and manually configure PATH and JAVA_HOME to be correctly recognized by the system and IDE.
How to correctly implement runtime file writing in Java applications (avoiding JAR internal write failures)
Mar 09, 2026 pm 07:57 PM
After a Java application is packaged as a JAR, data cannot be written directly to the resources in the JAR package (such as test.txt) because the JAR is essentially a read-only ZIP archive; the correct approach is to write variable data to an external path (such as a user directory, a temporary directory, or a configuration-specified path).
What is the underlying principle of array expansion in Java_Java memory dynamic adjustment analysis
Mar 09, 2026 pm 09:45 PM
ArrayList.add() triggers expansion because grow() is called when size is equal to elementData.length. The first add allocates 10 capacity, and subsequent expansion is 1.5 times and not less than the minimum requirement, relying on delayed initialization and System.arraycopy optimization.
How to safely read a line of integer input in Java and avoid Scanner blocking
Mar 06, 2026 am 06:21 AM
This article introduces typical blocking problems when using Scanner to read multiple integers in a single line. It points out that hasNextInt() will wait indefinitely when there is no subsequent input, and recommends a safe alternative with nextLine() string splitting as the core.





