This Java program is to Implement Sorted array. A sorted array is an array data structure in which each element is sorted in numerical, alphabetical, or some other order, and placed at equally spaced addresses in computer memory.
Here is the source code of the Java program to implement sorted array. The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.Arrays;
public class SortedArray<T>
{
private T[] array;
public SortedArray(T[] array)
{
this.array = array;
}
public void sort()
{
Arrays.sort(array);
}
public T[] getArray()
{
return array;
}
public static void main(String...arg)
{
Integer[] inums = {10,9,8,7,6};
Float[] fnums = {23.9f,5.5f,10.8f,2.5f,82.0f};
Double[] dnums = {12.5,244.92,1.9,98.3,35.2};
String[] strings = {"banana","pineapple","apple","mango","jackfruit"};
System.out.println("The Values Before sorting");
System.out.println();
System.out.println("Integer Values");
for (int i = 0; i < inums.length; i++)
System.out.print(inums[i] + "\t");
System.out.println();
System.out.println("Floating Values");
for (int i = 0; i < fnums.length; i++)
System.out.print(fnums[i] + "\t");
System.out.println();
System.out.println("Double Values");
for (int i = 0; i < dnums.length; i++)
System.out.print(dnums[i] + "\t");
System.out.println();
System.out.println("String Values");
for (int i = 0; i < strings.length; i++)
System.out.print(strings[i] + "\t");
SortedArray<Integer> integer = new SortedArray<Integer>(inums);
SortedArray<Float> floating = new SortedArray<Float>(fnums);
SortedArray<Double> doubles = new SortedArray<Double>(dnums);
SortedArray<String> string = new SortedArray<String>(strings);
integer.sort();
floating.sort();
doubles.sort();
string.sort();
inums = integer.getArray();
fnums = floating.getArray();
dnums = doubles.getArray();
strings = string.getArray();
System.out.println();
System.out.println("The Values After sorting");
System.out.println();
System.out.println("Integer Values");
for (int i = 0; i < inums.length; i++)
System.out.print(inums[i] + "\t");
System.out.println();
System.out.println("Floating Values");
for (int i = 0; i < fnums.length; i++)
System.out.print(fnums[i] + "\t");
System.out.println();
System.out.println("Double Values");
for (int i = 0; i < dnums.length; i++)
System.out.print(dnums[i] + "\t");
System.out.println();
System.out.println("String Values");
for (int i = 0; i < strings.length; i++)
System.out.print(strings[i] + "\t");
}
}
$javac SortedArray.java $java SortedArray The Values Before sorting Integer Values 10 9 8 7 6 Floating Values 23.9 5.5 10.8 2.5 82.0 Double Values 12.5 244.92 1.9 98.3 35.2 String Values banana pineapple apple mango jackfruit The Values After sorting Integer Values 6 7 8 9 10 Floating Values 2.5 5.5 10.8 23.9 82.0 Double Values 1.9 12.5 35.2 98.3 244.92 String Values apple banana jackfruit mango pineapple
Related posts:
How to Break from Java Stream forEach
A Guide to HashSet in Java
Guide to WeakHashMap in Java
Java Program to Remove the Edges in a Given Cyclic Graph such that its Linear Extension can be Found
Java Program to Check whether Directed Graph is Connected using BFS
Spring Cloud AWS – RDS
Compare Two JSON Objects with Jackson
Spring MVC Async vs Spring WebFlux
A Guide to the ResourceBundle
Hướng dẫn Java Design Pattern – Template Method
Java Program to Implement Binary Search Tree
Removing all duplicates from a List in Java
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
Java Program to Implement Rope
LIKE Queries in Spring JPA Repositories
More Jackson Annotations
Concrete Class in Java
Spring Boot - Interceptor
How to Store Duplicate Keys in a Map in Java?
Java Program to Implement Bubble Sort
A Guide to the Java LinkedList
Lập trình đa luồng với CompletableFuture trong Java 8
Guide to Spring 5 WebFlux
Java Program to Describe the Representation of Graph using Adjacency Matrix
Guide to @ConfigurationProperties in Spring Boot
Converting String to Stream of chars
Java Program to Implement Find all Forward Edges in a Graph
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Spring MVC and the @ModelAttribute Annotation
An Intro to Spring Cloud Contract
Java Program to Implement Hash Tables with Quadratic Probing
Deque và ArrayDeque trong Java