Scribd
Upload
16 views1 page

Java Program for Ascending Sort

This Java program sorts and displays numbers entered by the user. It repeatedly calls a method to read 10 numbers from the user, returning 1 for success or 0 for failure. If reading fails, it tries again. Once numbers are read successfully, it sorts them in ascending order using a bubble sort algorithm. Finally, it displays the sorted numbers.

Uploaded by

Elden
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
16 views1 page

Java Program for Ascending Sort

This Java program sorts and displays numbers entered by the user. It repeatedly calls a method to read 10 numbers from the user, returning 1 for success or 0 for failure. If reading fails, it tries again. Once numbers are read successfully, it sorts them in ascending order using a bubble sort algorithm. Finally, it displays the sorted numbers.

Uploaded by

Elden
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as RTF, PDF, TXT or read online on Scribd

import [Link].

*;

public class Sorting {


static int status=0;
public static void main(String[] args)
{
int[] nums=new int[10];
//Call function readNumbers
//Get return value: if 1 then success, if 0 then failure
//Check if status=1(success), then proceeds to Sorting
//If status=0(failure while reading), then again read the numbers
while (status==0)
{
status=readNumbers(nums);
}
sort(nums);
displayNumbers(nums);
}
public static int readNumbers(int[] nums)
{
//Reading ten numbers from the user
[Link]("Enter ten numbers. Press Enter after each number: ");
for (int i=0; i<[Link]; i++)
{
BufferedReader br = new BufferedReader(new
InputStreamReader([Link]));
try
{
nums[i]=[Link]([Link]());
} catch (Exception e)
{
[Link]("Error! Mistake during Entry of numbers. Try
again");
//Return 0 to indicate failure
return 0;
}
}
//Return 1 to indicate success
return 1;
}
public static void sort(int[] nums)
{
//Sorting the numbers in Ascending Order
int lower, higher;
for (int index1 = 0 ; index1 < [Link] ; index1++)
for (lower = index1+1 ; lower < [Link] ; lower++)
if (nums[index1] > nums[lower])
{
higher = nums[index1];
nums[index1] = nums[lower];
nums[lower] = higher;
}
}
public static void displayNumbers(int[] nums)
{
//Displaying the numbers
[Link]("Numbers in ascending order are: ");
for (int index2 = 0 ; index2 < [Link] ; index2++)
[Link](nums[index2]);
}
}

You might also like