// Example string data
String originalData = "mySecretPassword123";

// Generate a hash code for the string
int hash = originalData.hashCode();

// Display the original data and its hash
System.out.println("Original Data: " + originalData);
System.out.println("Hash Code: " + hash);

// Demonstrate that the same string always produces the same hash
String sameData = "mySecretPassword123";
int sameHash = sameData.hashCode();
System.out.println("Same Data Hash: " + sameHash);

// Demonstrate that a small change in data produces a different hash
String modifiedData = "mySecretPassword124";
int modifiedHash = modifiedData.hashCode();
System.out.println("Modified Data: " + modifiedData);
System.out.println("Modified Data Hash: " + modifiedHash);

import java.util.Scanner;
import java.util.Random;

boolean done = false;
int hash;
String salt = "";
String savedPassword = "";
String savedSalt = "";

Scanner scan = new Scanner(System.in);
Random random = new Random();

while (!done) {
    System.out.println("What would you like to do?\nA: Generate Password\nB: Verify Password");
    String action = scan.nextLine();
    
    if (action.charAt(0) == 'A') {
        System.out.println("Enter Password: ");
        String plaintext = scan.nextLine();

        StringBuilder saltBuilder = new StringBuilder();
        int saltLength = 16; 
        String saltCharacters = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
        
        for (int i = 0; i < saltLength; i++) {
            saltBuilder.append(saltCharacters.charAt(random.nextInt(saltCharacters.length())));
        }
        salt = saltBuilder.toString();
        
        hash = (salt + plaintext).hashCode();

        savedPassword = Integer.toString(hash);
        savedSalt = salt;
        System.out.println("Hash and salt generated. Salt: " + salt);

    } else if (action.charAt(0) == 'B') {
        if (savedPassword.isEmpty()) {
            System.out.println("No password has been set.");
        } else {
            System.out.println("Enter Password to Verify: ");
            String plaintext = scan.nextLine();

            int verifyHash = (savedSalt + plaintext).hashCode();

            if (savedPassword.equals(Integer.toString(verifyHash))) {
                System.out.println("Login Successful!");
            } else {
                System.out.println("Login failed.");
            }
        }

    } else {
        System.out.println("Action not found.");
    }

    System.out.println("Would you like to exit? [Y/N]: ");
    String response = scan.nextLine();
    if (response.charAt(0) == 'Y') {
        done = true;
    }
}
scan.close();

import java.util.ArrayList;

public static void selectionSort(ArrayList<Integer> elements)
{
    // outer loop to iterate through every element in the ArrayList
    for (int j = 0; j < elements.size() - 1; j++)
    {
        // set the current value being compared 
        int minIndex = j;
        // INNER LOOP TO ITERATE EVERY ELEMENT AFTER THE minIndex VALUE
        for (int k = j + 1; k < elements.size(); k++)
        {
            // FIND THE SMALLEST ELEMENT IN THE LIST AND SET IT TO THE minINDEX
            if (elements.get(k) < elements.get(minIndex))
            {
                minIndex = k;
            }
        }
        // swap minIndex value with new smaller value
        int temp = elements.get(j);
        elements.set(j, elements.get(minIndex));
        elements.set(minIndex, temp);
    }
}

// test cases
ArrayList<Integer> arr1 = new ArrayList<>();
arr1.add(3);
arr1.add(86);
arr1.add(-20);
arr1.add(14);
arr1.add(40);
System.out.println(arr1.toString());
selectionSort(arr1);
System.out.println(arr1.toString());

import java.util.ArrayList;


public static void insertionSort(ArrayList<Integer> elements)
{
    // outer loop to iterate through every element in the list
    // notice how it starts at 1 because the 0 index is considered "sorted"
    for (int j = 1; j < elements.size(); j++) {
        // store  current element in a temporary variable
        int temp = elements.get(j);
        // initialize the possible index where the current element might be inserted
        int possibleIndex = j;
        
        // shift elements to the right until the correct position for temp is found
        while (possibleIndex > 0 && temp < elements.get(possibleIndex - 1)) 
        {
            // move previous element to the right
            elements.set(possibleIndex, elements.get(possibleIndex - 1));
            
            // decrement index to check values to the left
            possibleIndex--;
        }
        
        // insert current element into correct position
        elements.set(possibleIndex, temp);
    }
}

// test cases
ArrayList<Integer> arr1 = new ArrayList<>();
arr1.add(3);
arr1.add(86);
arr1.add(-20);
arr1.add(14);
arr1.add(40);
System.out.println(arr1.toString());
insertionSort(arr1);
System.out.println(arr1.toString());

import java.util.ArrayList;

public static ArrayList e(ArrayList<Integer> a) {   
    for (int b = 1; b < a.size(); b++) {
        int c = a.get(b);
        int d = b;
        while (d > 0 && c < a.get(d - 1)) {
            a.set(d, a.get(d - 1));
            d--;
        }
        a.set(d, c);
    }
    return a;
}

ArrayList<Integer> arr1 = new ArrayList<>();
arr1.add(85);
arr1.add(92);
arr1.add(76);
arr1.add(88);
arr1.add(67);
arr1.add(94);
arr1.add(73);
arr1.add(89);
arr1.add(91);
arr1.add(82);
arr1.add(78);
arr1.add(88);
arr1.add(95);
arr1.add(60);
arr1.add(84);
arr1.add(77);
arr1.add(91);
arr1.add(68);
arr1.add(97);
arr1.add(83);

System.out.println(e(arr1).toString());

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

public class Main {
    public static void main(String[] args) {
        ArrayList<Integer> numbers = new ArrayList<Integer>();
        
        // missing 3, 6, 7, and 10
        numbers.add(1);
        numbers.add(2);
        
        numbers.add(4);
        numbers.add(5);
        
      
        numbers.add(8);
        numbers.add(9);
        
        
        Scanner scanNumber = new Scanner(System.in);
        System.out.println("Enter a number 1-10");
        Integer desiredNumber = scanNumber.nextInt();
        

        for (int index = 0; index < numbers.size(); index++) {
            // notice how the == operator is used to compare integers
            if (numbers.get(index) == desiredNumber) {

                System.out.println(desiredNumber + " is in the list");
                scanNumber.close();
            } else {
                System.out.println(desiredNumber + " is not in the list.");
                scanNumber.close();
            }
        }

        
    }   

}

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


public static int binarySearch(ArrayList<Integer> elements, int target)
{
    // min and max is the RANGE of the ArrayList
    int min = 0;
    int max = elements.size() - 1;

    // while loop will ensure the array continues to be split in half until target is found
    while (min <= max)
    {
        // this middle value is the INDEX not VALUE. 
        int middle = (min + max) / 2;

        // now we check if the middle VALUE is less than the number we want. 
        // *remember* the list is sorted so...
        // if middle is less than the target, you want to split the array into the UPPER HALF
        // if middle is more than the target, you want to split the array into the LOWER HALF
        if (elements.get(middle) < target) { // too low
            min = middle + 1;
        } else if (elements.get(middle) > target) { // too high
            max = middle - 1;
        } else if (elements.get(middle) == target) { // just right
            return middle;
        }
    }

    return -1;
}

ArrayList<Integer> numbers = new ArrayList<>();
numbers.add(-20);
numbers.add(3);
numbers.add(15);
numbers.add(81);
numbers.add(432);

// binary searches HAVE to be sorted
Collections.sort(numbers);


int index = binarySearch(numbers, 15);
System.out.println(index);

index = binarySearch(numbers, -20);
System.out.println(index);

index = binarySearch(numbers, 432);
System.out.println(index);

index = binarySearch(numbers, 53);
System.out.println(index);

import java.util.ArrayList;

boolean found = false;
ArrayList<String> videoGames = new ArrayList<String>();
videoGames.add("Roblox");
videoGames.add("Fortnite");
videoGames.add("Valorant");
videoGames.add("Apex Legends");
videoGames.add("GTA V");

for (String videoGame : videoGames) {
    // notice how the == operator is used to compare integers
    if (videoGame == "GTA V") {
        System.out.println("GTA V is offered. It costs 120391203 dollars");
        found = true;
    }
}

if (!found) {
    System.out.println("Not offered. Go away.");
}