Java Program to Implement Sorted Array

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:

Compare Two JSON Objects with Jackson
Generating Random Numbers in a Range in Java
Giới thiệu Swagger – Công cụ document cho RESTfull APIs
Java InputStream to Byte Array and ByteBuffer
Java Program to Perform Partition of an Integer in All Possible Ways
How to Break from Java Stream forEach
Java Program to Find the Shortest Path Between Two Vertices Using Dijkstra’s Algorithm
Java Web Services – JAX-WS – SOAP
Java Program to Perform the Sorting Using Counting Sort
Cơ chế Upcasting và Downcasting trong java
So sánh ArrayList và Vector trong Java
Class Loaders in Java
Java Program to Implement Word Wrap Problem
Java Program to Implement Branch and Bound Method to Perform a Combinatorial Search
Logging a Reactive Sequence
Java Program to Implement Threaded Binary Tree
Introduction to the Functional Web Framework in Spring 5
String Joiner trong Java 8
@Order in Spring
Java Program to Check whether Undirected Graph is Connected using DFS
Spring Security Remember Me
Tìm hiểu cơ chế Lazy Evaluation của Stream trong Java 8
Java Program to Check if a Given Graph Contain Hamiltonian Cycle or Not
Registration – Activate a New Account by Email
Lập trình hướng đối tượng (OOPs) trong java
Spring Security Registration – Resend Verification Email
Java Program to Implement Bresenham Line Algorithm
Java Program to Check the Connectivity of Graph Using DFS
A Guide to Apache Commons Collections CollectionUtils
Autoboxing và Unboxing trong Java
Java Program to Implement SimpeBindings API
Show Hibernate/JPA SQL Statements from Spring Boot