
Concept explainers
import java.util.ArrayList;
import java.util.Random;
class Main {
public static void main(String[] args) {
Random rand = new Random();
ArrayList<Integer> a = new ArrayList<Integer>();
for(int i = 0; i < 100; i++) {
a.add(rand.nextInt(100));
}
print(a);
System.out.println("----");
sort(a);
print(a);
// simplified Quicksort
public static void sort(ArrayList<Integer> a) {
if (a.size() <= 1)
return;
// Pick a Pivot
int m = a.size() / 2;
int pivot = a.get(m);
}
ArrayList<Integer> smaller = new Arraylist<Integer>();
ArrayList<Integer> same = new ArrayList<Integer>();
ArrayList<Integer> larger = new ArrayList<Integer>();
for (Integer x : a) {
if (x < pivot) {
smaller.add(x);
}
else if(x > pivot) {
larger.add(x);
}
else {
same.add(x);
}
}
sort(smaller);
sort(larger);
a.clear();
a.addAll(smaller);
a.addAll(same);
a.addAll(larger);
}
}
public static void print(ArrayList<Integer> a) {
for (Integer x : a) {
System.out.println(x);
}
}
}
What's wrong with my code?

Step by stepSolved in 4 steps with 2 images

- How exactly can one determine how successful an ArrayList really is?arrow_forwardHow can the performance of an ArrayList be evaluated?arrow_forwardimport java.util.*; public class Main{ public static void main(String[] args) { Main m = new Main(); m.go(); } private void go() { List<Stadium> parks = new ArrayList<Stadium>(); parks.add(new Stadium("PNC Park", "Pittsburgh", 38362, true)); parks.add(new Stadium("Dodgers Stadium", "Los Angeles", 56000, true)); parks.add(new Stadium("Citizens Bank Park", "Philadelphia", 43035, false)); parks.add(new Stadium("Coors Field", "Denver", 50398, true)); parks.add(new Stadium("Yankee Stadium", "New York", 54251, false)); parks.add(new Stadium("AT&T Park", "San Francisco", 41915, true)); parks.add(new Stadium("Citi Field", "New York", 41922, false)); parks.add(new Stadium("Angels Stadium", "Los Angeles", 45050, true)); Collections.sort(parks, Stadium.ByKidZoneCityName.getInstance()); for (Stadium s : parks) System.out.println(s); }}…arrow_forward
- What is wrong with my Java code? public static void main(String[] args) { class IncrementClass<T> { T value; } IncrementClass<String> i = new IncrementClass<>(); int[] intArray = new int[10]; for(i.value = 0; i.value<intArray.length;i.value++){ intArray[i.value]=i.value; System.out.print(intArray[i.value]); } }arrow_forwardCode debug JAVA import java.util.ArrayList;public class ArrayList {public static ArrayList<Integer> reverse(ArrayList<Integer> list) {for (int i = 0; i < list.size(); i++) {System.out.println(list);}public static ArrayList<Integer> getReverse(ArrayList<Integer> list){for (int index = 0; index < list.size() / 2; index++) {int temp = list.get(index);list.set(index, list.get(list.size() - index - 1));//swaplist.set(list.size() - index - 1, temp); //swap}return list;}}public static void main(String[] args) {ArrayList<Integer> list = new ArrayList<>();list.add(1);list.add(2);list.add(3);System.out.println("Original elements : " + list);System.out.println("Reversed elements : " + getReverse(list));}}arrow_forwardExercise 2: Consider the following class: public class Sequence { private ArrayList values; public Sequence() { values = new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); } } Add a method public Sequence merge(Sequence other) that merges two sequences, alternating ele- ments from both sequences. If one sequence is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer sequence. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then a.merge(b) returns the sequence 1 9 4 7 9 4 16 9 11 without modifying a or b.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





