Unit 7 Homework

• Homework:

Homework:

• Sort an ArrayList in descending order and swap the first and last elements
• Find and display the hashCode of an Arraylist before and after being sorted
• Return "ascending" if the list is sorted in ascending order, return "descending" if it is descending, and return "neither" if neither

ArrayList<Integer> n = new ArrayList<Integer>();

boolean a;

boolean b;


for (int i = 0; i < 5; i++){
    n.add(i);
}

for (int i = 5; i > 0; i--){
    n.add(i);
}

System.out.println("HashCode: " + n.hashCode());
System.out.println("Original: " + n);


n.sort(Comparator.reverseOrder());
System.out.println("Sorted: " + n);
System.out.println("HashCode: " + n.hashCode());

Collections.swap(n, 4, 0);
System.out.println("Swapped first and last: " + n);
System.out.println("HashCode: " + n.hashCode());


for (int i=0; i < n.size() - 1; i++){
    if (!(n.get(i) <= n.get(i + 1))){
        boolean a = false;
    }
    if (!(n.get(i) >= n.get(i + 1))){
        boolean b = false;
    }
}


if (a){
    System.out.println("ascending");
}
if (b){
    System.out.println("descending");
}
else{
    System.out.println("neither");
}

HashCode: -1631985086
Original: [0, 1, 2, 3, 4, 5, 4, 3, 2, 1]
Sorted: [5, 4, 4, 3, 3, 2, 2, 1, 1, 0]
HashCode: -287789284
Swapped first and last: [3, 4, 4, 3, 5, 2, 2, 1, 1, 0]
HashCode: 162496028
neither