is array Sorted - Java Collection Framework

Description

is array Sorted

Demo Code

//package com.java2s;

public class Main {
    public static <T extends Comparable<T>> boolean isSorted(T arr[]) {
        if (arr.length == 1)
            return true;

        T prev = arr[0];//from   www. ja  v  a2  s .  com
        for (int i = 1; i < arr.length; i++) {
            if (arr[i].compareTo(prev) < 0)
                return false;
            prev = arr[i];
        }

        return true;
    }
}

• Previous
• Next

Related Tutorials

• generate sorted array
• insert sort the most stable sort algorithm times of comparing equals times of swap two times as fast as bubble sort a little faster than select sort
• This is a generic version of C.A.R Hoare's Quick Sort algorithm.
• Reverse sort a 2d double array by row on the column given by index.
• sort Two Arrays