Collegeboard - ArrayLists

7.1 Intro to ArrayLists

An ArrayList is a utility from the java.util package
To declare a variable, use the format ArrayList<DataType> variableName = new ArrayList<DataType>(initial number of elements);
Unlike arrays, ArrayLists are mutable (can be resized after initialization)
Functions as a more versatile array
- Does technically take more space than an array but for the purposes of CSA it shouldn’t matter

Difference between Array and Arraylist:

Array	Arraylist
Fixed length	Resizable length
Fundamental Java Feature	Part of a Framework
An object with no methods	A Class with many methods
Not very flexible	Flexible
Can store primitives	Cannot store primitives - stores objects instead

Example of Array: Basketball players on court

Example of Arraylist: Dodgeball players on court

Question

When should we use ArrayLists vs Arrays?

Answer: Use them when the number of variables inside the list is changing in side, you use it.

Showing how ArrayLists are mutable:

  
import java.util.ArrayList;

class ArrayListExample { 
    public static void main(String[] args) 
    { 
        // Size of ArrayList 
        int n = 5; 
  
        // Declaring ArrayList with initial size n 
        ArrayList<Integer> arr1 = new ArrayList<Integer>(n); 
  
        // Declaring ArrayList without initial size
        ArrayList<Integer> arr2 = new ArrayList<Integer>(); 
  
        // Printing ArrayList 
        System.out.println("Array 1:" + arr1); 
        System.out.println("Array 2:" + arr2); 
  
        // Appending new elements to the end of the list 
        for (int i = 1; i <= n; i++) { 
            arr1.add(i); 
            arr2.add(i); 
        } 
  
        // Printing ArrayList 
        System.out.println("Array 1:" + arr1); 
        System.out.println("Array 2:" + arr2); 
    } 
}
ArrayListExample.main(null);

Array 1:[]
Array 2:[]
Array 1:[1, 2, 3, 4, 5]
Array 2:[1, 2, 3, 4, 5]

7.1 Popcorn Hack

Create an ArrayList that stores the integers 5, 8, 14, 18, 24, 39, and 56 and only print the numbers that are divisible by 3.

  
import java.util.ArrayList;

public class DivisibleBy3 {
    public static void main(String[] args) {
        ArrayList<Integer> array = new ArrayList<Integer>();

        array.add(5);
        array.add(8);
        array.add(14);
        array.add(18);
        array.add(24);
        array.add(39);
        array.add(56);

        System.out.println("Numbers divisble by 3:");
        for (int i = 0; i < array.size(); i++){
            if (array.get(i) % 3 == 0) {
                System.out.println(array.get(i));
            }
        }
    }
}
DivisibleBy3.main(null);

Numbers divisble by 3:
18
24
39

Vocabulary Refresher

An element is a single value in the array
The **index** of an element is the position of the element in the array or ArrayList
- The first index of an ArrayList, like arrays is also 0
The length of an array is the number of elements in the array.

7.2 Arraylist Methods

add()
- Adding a value to the ArrayList
- Can be used to create an element at a specific index in the ArrayList - when this happens, everything at the positions of index and higher are moved to the right by 1
get()
- Get the value of an index in the ArrayList
set()
- Change the value at an index in the ArrayList
remove()
- Delete the value at in index in the ArrayList
clear()
- Remove all values in an ArrayList
size()
- Get the length of the ArrayList

  
import java.util.ArrayList;

public class Test {
    public static void main(String[] args) {
        ArrayList<Integer> test = new ArrayList<>();
        System.out.println(test.size());
        test.add(1); //index 0
        test.add(2); // index 1
        test.add(3); // index 2
        test.add(4); // index 3
        test.add(5); // index 4
        test.add(6); // index 5
        test.add(7); // index 6

        System.out.println(test);

        int i = test.set(1, 200); // prints what used to be at index 1
        int x = test.remove(4); // prints what was removed

        System.out.println(i);
        System.out.println(x);
        System.out.println(test);
    }
}
Test.main(null);

0
[1, 2, 3, 4, 5, 6, 7]
2
5
[1, 200, 3, 4, 6, 7]

Printing an ArrayList

You can’t print an array without a loop
You can print ArrayLists with just one System.out.println()

  
import java.util.ArrayList;

public class Main {
    public static void main(String[] args)
    {
        ArrayList<String> arr = new ArrayList<String>(); //initializes the arraylist object

        arr.add("I agree");
        arr.add(0, "You agree");
        System.out.println(arr);

        arr.set(0, "They agree");

        arr.add("I disagree");
        arr.remove(2);
        
        System.out.println();
        System.out.println(arr);
    }
}
Main.main(null);

[You agree, I agree]

[They agree, I agree]

7.2 Popcorn Hack

Finish the code below so that all duplicates in the ArrayList are removed.

  
import java.util.ArrayList;

public class RemoveDuplicates {
    public static void main(String[] args) {
        ArrayList<Integer> arr = new ArrayList<>(); // creating new arraylist of integers
        
        // adding integers to the arraylist
        arr.add(1);
        arr.add(7);
        arr.add(9);
        arr.add(13);
        arr.add(3);
        arr.add(7);
        arr.add(9);
        arr.add(2);

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

        for (int i = 0; i < arr.size(); i++) {
            int x = arr.get(i);
            if (!uniqueArr.contains(x)) {
                uniqueArr.add(x);
            }
        }

        System.out.println(uniqueArr);
    }
}
RemoveDuplicates.main(null);

[1, 7, 9, 13, 3, 2]

Array to ArrayList

You can use the Arrays.asList() method to convert an existing array to an ArrayList

  
public class ArrayListFromArray
{
    public static void main(String[] args)
    {
       String[] names = {"Kim", "Tay", "Tran", "Ethan", "Sheng", "Raymond"};
       ArrayList<String> namesList = new ArrayList<String>(Arrays.asList(names));
       System.out.println(namesList);
    }
}
ArrayListFromArray.main(null);

[Kim, Tay, Tran, Ethan, Sheng, Raymond]

7.3 Traversing ArrayLists

You can traverse an ArrayList the same way as an array, with some exceptions:
Deleting elements in the ArrayList while iterating over the ArrayList needs to be carefully done
Using an enhanced for loop can result in the ConcurrentModificationException error
- Do not delete elements in an ArrayList while using an enhanced for loop

  
public static void main(String[] args)
{
    ArrayList<Integer> arr = new ArrayList<>();        
    arr.add(1);
    arr.add(7);
    arr.add(9);
    arr.add(13);
    arr.add(3);
    arr.add(7);
    arr.add(9);
    arr.add(2);

    for (int i = 0; i < arr.size(); i++) //for loop, would work the same as with an array
    {
        System.out.print(arr.get(i) + " ");
    }
    System.out.println();

    for (Integer i : arr) //enhanced for loop without removing, same as an array
    {
        System.out.print(i + " ");
    }

}
main(null);

1 7 9 13 3 7 9 2 
1 7 9 13 3 7 9 2 

  
public static void main(String[] args)
{
    ArrayList<Integer> arr = new ArrayList<>();        
    arr.add(1);
    arr.add(7);
    arr.add(9);
    arr.add(13);
    arr.add(3);
    arr.add(7);
    arr.add(9);
    arr.add(2);

    for (Integer i : arr) //throws a ConcurrentModificationException
    {
        if (i % 2 == 0)
        {
            arr.remove(i);
        }
    }

}
main(null);

---------------------------------------------------------------------------

java.util.ConcurrentModificationException: null

	at java.base/java.util.ArrayList$Itr.checkForComodification(ArrayList.java:1013)

	at java.base/java.util.ArrayList$Itr.next(ArrayList.java:967)

	at .main(#12:13)

	at .(#35:1)

Popcorn Hack

Traverse the following ArrayList using a loop. Remove each element that is a multiple of 4.

  
public static void main(String[] args)
{
    ArrayList<Integer> arr = new ArrayList<>();        
    arr.add(1);
    arr.add(7);
    arr.add(9);
    arr.add(80);
    arr.add(13);
    arr.add(3);
    arr.add(7);
    arr.add(8);
    arr.add(2);
    arr.add(16);

    for (int i = arr.size() - 1; i >= 0; i--) {
        if (arr.get(i) % 4 == 0) {
            arr.remove(i);
        }
    }

    System.out.println(arr);
}
main(null);

[1, 7, 9, 13, 3, 7, 2]

7.4 Developing Algorithms Using ArrayLists

For the most part, algorithms in ArrayLists and arrays are very similar.

Popcorn Hacks

Find the maximum, minimum, and sum of an ArrayList.

  
public static void main(String[] args)
{
    ArrayList<Integer> arr = new ArrayList<>();        
    arr.add(1);
    arr.add(7);
    arr.add(9);
    arr.add(80);
    arr.add(13);
    arr.add(3);
    arr.add(7);
    arr.add(8);
    arr.add(2);
    arr.add(16);

    int max = Integer.MIN_VALUE;
        int min = Integer.MAX_VALUE;
        int sum = 0;

        for (Integer value : arr) {
            if (value > max) {
                max = value;
            }

            if (value < min) {
                min = value;
            }

            sum += value;
        }

        System.out.println("Maximum: " + max);
        System.out.println("Minimum: " + min);
        System.out.println("Sum: " + sum);
}
main(null);

Maximum: 80
Minimum: 1
Sum: 146

7.5 Searching

Searching in an ArrayList allows you to find an element, if it exists, an index is returned
All that is needed to search any linear structure is a standard for loop and if block
Typically, if the element is not found then -1 is returned, however a boolean value can also be used

Example of Linear Search

  
import java.util.ArrayList;

public class LinearSearch {
    public static int linearSearch(ArrayList<Integer> list, int target) {
        for (int i = 0; i < list.size(); i++) {
            if (list.get(i) == target) {
                return i; // return index of target element if found
            }
        }
        return -1; // return -1 if the target element is not in the array
    }

    public static void main(String[] args) {
        ArrayList<Integer> numbers = new ArrayList<>();
        numbers.add(5);
        numbers.add(10);
        numbers.add(15);
        numbers.add(20);
        numbers.add(25);

        int target = 15; // target of search
        int result = linearSearch(numbers, target);

        if (result != -1) {
            System.out.println(target + " found at index " + result);
        } else {
            System.out.println(target + " not found in the ArrayList.");
        }
    }
}

LinearSearch.main(null);

15 found at index 2

The linear search algorithm searches for a specific target value (15 in this example) within the ArrayList by iterating through its elements one by one
It checks if the element at the current index (list.get(i)) is equal to the target value
If a match is found, the index is returned; else, it continues the loop until the end of the ArrayList is reached

Popcorn Hack

Finish the code below, write code that checks if favoriteFlavor is in chipsBag
Using a loop, print a message saying if favoriteFlavor is in the bag

  
import java.util.ArrayList;
import java.util.Scanner;

public class FavoriteChip {
    public static void main(String[] args) {
        ArrayList<String> chipsBag = new ArrayList<>();
        Scanner scanner = new Scanner(System.in);

        chipsBag.add("BBQ");
        chipsBag.add("Cheddar");
        chipsBag.add("Salt and Pepper");

        System.out.print("Enter your favorite chip flavor: ");
        String favoriteFlavor = scanner.nextLine();

        System.out.println(favoriteFlavor);
        
        boolean found = false;

        for (int i = 0; i < chipsBag.size(); i++) {
            if (favoriteFlavor.equals(chipsBag.get(i))) {
                found = true;
                break;
            }
        }
        
        if (found) {
            System.out.println("found");
        } else {
            System.out.println("not found");
        }
        
    }
}
FavoriteChip.main(null);

Enter your favorite chip flavor: BBQ
found

7.6 Sorting

There are 2 main sorting algorithms that Collegeboard focuses on, selection sort and insertion sort

Selection sort

Selection sort divides the ArrayList into two “subarrays,” the first is sorted and the second is unsorted.
Selection sort is easy to implement and is useful for sorting through small datasets.

Example of Selection sort

  
import java.util.ArrayList;

public class SelectionSort {
    public static void main(String[] args) {
        ArrayList<Integer> arrayList = new ArrayList<>();
        arrayList.add(64);
        arrayList.add(25);
        arrayList.add(12);
        arrayList.add(22);
        arrayList.add(11);

        selectionSort(arrayList);

        System.out.println("Sorted ArrayList: " + arrayList);
    }

    public static void selectionSort(ArrayList<Integer> arr) {
        int n = arr.size();

        for (int i = 0; i < n - 1; i++) {
            int minIndex = i;

            for (int j = i + 1; j < n; j++) {
                if (arr.get(j) < arr.get(minIndex)) {
                    minIndex = j;
                }
            }

            // Swap the found minimum element with the element at index i
            int temp = arr.get(i);
            arr.set(i, arr.get(minIndex));
            arr.set(minIndex, temp);
        }
    }
}
SelectionSort.main(null);

Sorted ArrayList: [11, 12, 22, 25, 64]

Start with an ArrayList, [64, 25, 12, 22, 11]
We want to arrange these numbers in order from smallest to largest, like [11, 12, 22, 25, 64]
selectionSort starts at the beginning of the list and looks for the smallest number in the whole list. In this case, it’s 11
It swaps 11 with the first number in the list (which is 64) so that 11 comes first
Now, the list looks like [11, 25, 12, 22, 64]
The function repeats this process for the remaining numbers, finding the next smallest (which is 12) and putting it in the second position
This continues until all numbers are in order
The final sorted list is [11, 12, 22, 25, 64]

Insertion Sort

In insertion sort, we assume that the first element is already sorted
The second element is then taken and is either inserted before the first element or kept in place to make the first 2 elements sorted
Insertion sort is adaptive as it does not need to perform as many comparisons and swaps as selection sort. If you expect the data to be partially ordered, insertion sort is the better option.

Example of Insertion Sort

  
import java.util.ArrayList;

public class InsertionSort {
    public static void insertionSort(ArrayList<Integer> arr) {
        int n = arr.size();
        for (int i = 1; i < n; i++) {
            int key = arr.get(i);
            int j = i - 1;

            // Move elements of arr[0..i-1] that are greater than key
            // to one position ahead of their current position
            while (j >= 0 && arr.get(j) > key) {
                arr.set(j + 1, arr.get(j));
                j = j - 1;
            }
            arr.set(j + 1, key);
        }
    }

    public static void main(String[] args) {
        ArrayList<Integer> arrayList = new ArrayList<>();
        arrayList.add(12);
        arrayList.add(11);
        arrayList.add(13);
        arrayList.add(5);
        arrayList.add(6);

        System.out.println("Original ArrayList: " + arrayList);

        insertionSort(arrayList);

        System.out.println("Sorted ArrayList: " + arrayList);
    }
}
InsertionSort.main(null);

Original ArrayList: [12, 11, 13, 5, 6]
Sorted ArrayList: [5, 6, 11, 12, 13]

Start with an ArrayList of numbers, [12, 11, 13, 5, 6]
We want to arrange these numbers in order from smallest to largest, like [5, 6, 11, 12, 13]
insertionSort starts with the second element (11)
It compares 11 to the elements on its left. It finds that 11 is smaller than 12, so it shifts 12 one position to the right to make space for 11
The ArrayList now looks like [11, 12, 13, 5, 6]
The function repeats this process for each element in the list. It moves 13 to the right place and then 5 and 6
After sorting all the elements, the ArrayList is now sorted in ascending order: [5, 6, 11, 12, 13]

7.6 Popcorn Hack

Given an ArrayList of String objects, sort the following ArrayLists on ascending order of word length.

1)

  
import java.util.ArrayList;

public class SortByLength {
    public static void main(String[] args) {
        ArrayList<String> words = new ArrayList<>(); // creating new arraylist
        
        // adding words to the list
        words.add("theater");
        words.add("connection");
        words.add("seasonal");
        words.add("feast");
        words.add("meeting");

        int n = words.size();
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < n - i - 1; j++) {
                if (words.get(j).length() > words.get(j + 1).length()) {
                    String temp = words.get(j);
                    words.set(j, words.get(j + 1));
                    words.set(j + 1, temp);
                }
            }
        }

        System.out.println("Sorted by word length (ascending): " + words);
    }
}
SortByLength.main(null);

Sorted by word length (ascending): [feast, theater, meeting, seasonal, connection]

7.7 Ethical Issues Around Data Collection

When collecting data in a Java program, data security is VERY IMPORTANT. This involves any program that deals with

Necessary personal information
Information that is associated with results

Removing Data

When collected data is no longer needed, be sure to remove the information from your application
Removal of unnecessary data reduces risk of data breaches and protects sensitive information from unauthorized access

Anonymizing Data

When collecting user information, avoid asking for private information to identify users ie. phone numbers, social security numbers, etc.

Collegeboard Example

  
Scanner inputScanner = new Scanner(System.in);
String fullName = inputScanner.nextLine();

// implementation of code

int identifier = fullName.hashCode();
fullName = null;

// further implementation

In this example…

The user would type their full name in which it is used in the program
After, the identifier equates to the hash value of the original string and the fullName is set to null
Using the hash value instead of the actual name adds a degree of anonymity for the user
Turning the fullName to null also indicates that the code no longer needs to store the name of the user

This minimizes the possible impact of the data by reducing the likelihood of unintentional exposure of the user’s name within the program.

Hacks for Unit 7

Complete all questions and popcorn hacks
Write a Java program that creates an ArrayList of integers. Create methods for adding, removing, setting, getting, etc numbers and also sort the list. Then, utilize user input to determine which methods will actually be run and enable the user to also determine the specific index that a number will be added, removed.

  
import java.util.Scanner;

public class ArrayOperations {
  public static void main(String[] args) {
    int[] numbers = new int[10];
    int size = 0;
    Scanner scanner = new Scanner(System.in);

    while (true) {
      System.out.println("\nArray Operations:");
      System.out.println("1. Add number");
      System.out.println("2. Remove number");
      System.out.println("3. Set number");
      System.out.println("4. Get number");
      System.out.println("5. Sort array");
      System.out.println("6. Display array");
      System.out.println("7. Exit");

      System.out.print("Enter choice: ");
      int choice = scanner.nextInt();

      switch (choice) {
        case 1:
          if (size < numbers.length) {
            System.out.print("Enter number to add: ");
            int numToAdd = scanner.nextInt();
            System.out.print("Enter index to add at: ");
            int indexToAdd = scanner.nextInt();

            if (indexToAdd >= 0 && indexToAdd <= size) {
              for (int i = size; i > indexToAdd; i--) {
                  numbers[i] = numbers[i - 1];
              }
              numbers[indexToAdd] = numToAdd;
              size++;
              System.out.println(numToAdd + " added at index " + indexToAdd);
            } else {
              System.out.println("Invalid index.");
            }
          } else {
            System.out.println("Array is full.");
          }
          break;
        case 2:
          if (size > 0) {
            System.out.print("Enter index to remove: ");
            int indexToRemove = scanner.nextInt();
            if (indexToRemove >= 0 && indexToRemove < size) {
              for (int i = indexToRemove; i < size - 1; i++) {
                  numbers[i] = numbers[i + 1];
              }
              size--;
              System.out.println("Number removed from index " + indexToRemove);
            } else {
              System.out.println("Invalid index.");
            }
          } else {
            System.out.println("Array empty.");
          }
          break;
        case 3:
          System.out.print("Enter index to set: ");
          int indexToSet = scanner.nextInt();
          if (indexToSet >= 0 && indexToSet < size) {
            System.out.print("Enter number to set: ");
            int numToSet = scanner.nextInt();
            numbers[indexToSet] = numToSet;
            System.out.println("Number at index " + indexToSet + " set to " + numToSet);
          } else {
            System.out.println("Invalid index.");
          }
          break;
        case 4:
          if (size > 0) {
            System.out.print("Enter index to get: ");
            int indexToGet = scanner.nextInt();
            if (indexToGet >= 0 && indexToGet < size) {
              int value = numbers[indexToGet];
              System.out.println("Number at index " + indexToGet + ": " + value);
            } else {
              System.out.println("Invalid index.");
            }
          } else {
            System.out.println("Array is empty.");
          }
          break;
        case 5:
          for (int i = 0; i < size - 1; i++) {
            for (int j = 0; j < size - i - 1; j++) {
              if (numbers[j] > numbers[j + 1]) {
                int temp = numbers[j];
                numbers[j] = numbers[j + 1];
                numbers[j + 1] = temp;
              }
            }
          }
          System.out.println("Array sorted in ascending order.");
          System.out.print("Array: [");
          for (int i = 0; i < size; i++) {
            System.out.print(numbers[i]);
            if (i < size - 1) {
              System.out.print(", ");
            }
          }
          System.out.println("]");
          break;
        case 6:
          System.out.print("Array: [");
          for (int i = 0; i < size; i++) {
            System.out.print(numbers[i]);
            if (i < size - 1) {
              System.out.print(", ");
            }
          }
          System.out.println("]");
          break;
        case 7:
          System.out.println("Exiting program.");
          scanner.close();
          System.exit(0);
        default:
          System.out.println("Invalid choice. Please enter valid option.");
          break;
      }
    }
  }
}

ArrayOperations.main(null);

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter number to add: Enter index to add at: Invalid index.

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter number to add: Enter index to add at: 4 added at index 0

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Array: [4]

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter number to add: Enter index to add at: 7 added at index 1

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter number to add: Enter index to add at: 9 added at index 2

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter number to add: Enter index to add at: 2 added at index 3

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter index to remove: Number removed from index 2

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Array: [4, 7, 2]

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Enter index to get: Number at index 1: 7

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Array sorted in ascending order.
Array: [2, 4, 7]

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Array: [2, 4, 7]

Array Operations:
Add number
Remove number
Set number
Get number
Sort array
Display array
Exit
Enter choice: Exiting program.



The Kernel crashed while executing code in the the current cell or a previous cell. Please review the code in the cell(s) to identify a possible cause of the failure. Click <a href='https://aka.ms/vscodeJupyterKernelCrash'>here</a> for more info. View Jupyter <a href='command:jupyter.viewOutput'>log</a> for further details.

Challenge

You are given an ArrayList of Student objects. Each Student has a name (String) and a GPA (double). Create a program that sorts the Student objects in descending order of GPA.

  
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;

class Student {
    String name;
    double gpa;

    public Student(String name, double gpa) {
        this.name = name;
        this.gpa = gpa;
    }
}

public class SortByGPA {
    public static void main (String[] args) {
        ArrayList<Student> students = new ArrayList<>(); // creating new arraylist to store student objects

        students.add(new Student("Alice", 3.8));
        students.add(new Student("Bob", 3.9));
        students.add(new Student("Charlie", 3.7));
        students.add(new Student("David", 4.0));
        students.add(new Student("Eve", 3.5));

        Collections.sort(students, new Comparator<Student>() {
            @Override
            public int compare(Student student1, Student student2) {
                return Double.compare(student2.gpa, student1.gpa);
            }
        });

        for (Student student : students) {
            System.out.println("Name: " + student.name + ", GPA: " + student.gpa);
        }
    }
}
SortByGPA.main(null);

Name: David, GPA: 4.0
Name: Bob, GPA: 3.9
Name: Alice, GPA: 3.8
Name: Charlie, GPA: 3.7
Name: Eve, GPA: 3.5

Collegeboard - ArrayLists

7.1 Intro to ArrayLists

Question

7.1 Popcorn Hack

Vocabulary Refresher

7.2 Arraylist Methods

Printing an ArrayList

7.2 Popcorn Hack

Array to ArrayList

7.3 Traversing ArrayLists

Popcorn Hack

7.4 Developing Algorithms Using ArrayLists

Popcorn Hacks

7.5 Searching

Example of Linear Search

Popcorn Hack

7.6 Sorting

Selection sort

Example of Selection sort

Insertion Sort

Example of Insertion Sort

7.6 Popcorn Hack

1)

7.7 Ethical Issues Around Data Collection

Removing Data

Anonymizing Data

Hacks for Unit 7

Challenge

Further Reading

Plan 4

FRQ Mini-Lab 1

FRQ Mini-lab project