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:
Java Program to find the maximum subarray sum using Binary Search approach
Java Program to Implement Find all Back Edges in a Graph
Spring 5 and Servlet 4 – The PushBuilder
An Intro to Spring Cloud Vault
Converting a Stack Trace to a String in Java
HttpClient with SSL
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph
Create a Custom Auto-Configuration with Spring Boot
Introduction to Spring Data REST
Composition, Aggregation, and Association in Java
HttpClient 4 – Send Custom Cookie
Spring Boot Annotations
Hướng dẫn Java Design Pattern – Iterator
RegEx for matching Date Pattern in Java
Java Program to Represent Graph Using Adjacency Matrix
Shuffling Collections In Java
Java Program to implement Sparse Vector
Java Program to Implement Skew Heap
How to Define a Spring Boot Filter?
Java Program to Create a Minimal Set of All Edges Whose Addition will Convert it to a Strongly Conne...
Java Program to do a Breadth First Search/Traversal on a graph non-recursively
Annotation trong Java 8
Java Program to Convert a Decimal Number to Binary Number using Stacks
Compact Strings in Java 9
Java Program to Implement Attribute API
Java Program to Check whether Graph is a Bipartite using BFS
Java Program to Implement Quick Sort Using Randomization
Hướng dẫn Java Design Pattern – Mediator
Spring Boot - Interceptor
Mockito and JUnit 5 – Using ExtendWith
Java Program to Generate a Random Subset by Coin Flipping
Spring Boot - Database Handling