forked from Hithomelabs/Princeton1
Reviewed-on: Hithomelabs/Princeton1#17 Reviewed-by: kruti <krutis0201@gmail.com> Co-authored-by: hitanshu310 <hitanshu98@gmail.com> Co-committed-by: hitanshu310 <hitanshu98@gmail.com>
26 lines
578 B
Java
26 lines
578 B
Java
package com.hithomelabs.clients.Benchmarks.Sortables;
|
|
|
|
import com.hithomelabs.clients.Benchmarks.Sortable;
|
|
import com.hithomelabs.princeton1.common.Apple;
|
|
|
|
public class ReverseSortedApples implements Sortable<Apple> {
|
|
|
|
Apple[] apples;
|
|
|
|
public ReverseSortedApples(int size){
|
|
apples = new Apple[size];
|
|
for (int i = 0; i < size; i++)
|
|
apples[i] = new Apple(size-i);
|
|
}
|
|
|
|
@Override
|
|
public Apple[] getArray() {
|
|
return apples.clone();
|
|
}
|
|
|
|
@Override
|
|
public String getOrdering() {
|
|
return "REVERSE SORTED";
|
|
}
|
|
}
|