import
java.util.Arrays;
import
java.util.Calendar;
public
class
ArraySort {
void
fill(
int
a[],
int
n)
{
for
(
int
i =
0
; i < n; i++)
a[i] = i +
1
;
}
void
shuffle(
int
a[],
int
n)
{
for
(
int
i =
0
; i < n; i++) {
int
t = (
int
)Math.random() * a.length;
int
x = a[t];
a[t] = a[i];
a[i] = x;
}
}
void
performanceCheckOfSorting()
{
ArraySort obj =
new
ArraySort();
long
startTime = 0l;
long
endTime = 0l;
int
array1[] =
new
int
[
100000
];
int
n = array1.length;
obj.fill(array1, n);
startTime = Calendar.getInstance()
.getTimeInMillis();
Arrays.sort(array1);
endTime = Calendar.getInstance()
.getTimeInMillis();
System.out.println(
"Time Taken By Arrays.sort"
+
" Method On Trivial Use: "
+ (endTime - startTime)
+
"ms"
);
obj.fill(array1, n);
obj.shuffle(array1, n);
startTime = Calendar.getInstance()
.getTimeInMillis();
Arrays.sort(array1);
endTime = Calendar.getInstance()
.getTimeInMillis();
System.out.println(
"Time Taken By Arrays.sort"
+
" Method After Shuffling "
+
"Before Sorting : "
+ (endTime - startTime)
+
"ms"
);
}
public
static
void
main(String args[])
{
ArraySort obj =
new
ArraySort();
obj.performanceCheckOfSorting();
}
}