CCF_100/ASDV-Java
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Reset author name to chosen name ✨

Browse Source
This commit is contained in:
Chloe Fontenot 🏳️‍⚧️
2025-10-19 22:00:41 -05:00
parent 12cf757236
commit 168b35c94a
287 changed files with 0 additions and 17381 deletions
Download Patch File Download Diff File Expand all files Collapse all files

30
Semester 3/Assignments/Lab_ChloeFontenot_MaximumOrderedString/src/main/java/edu/slcc/asdv/chloe/lab_calebfontenot_maximumorderedstring/CompareSize.java
View File

@@ -1,30 +0,0 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package edu.slcc.asdv.chloe.lab_chloefontenot_maximumorderedstring;
import java.util.Comparator;
/**
*
* @author chloe
*/
public class CompareSize implements Comparator {
@Override
public int compare(Object o1, Object o2)
{
int str1 = ((String) o1).length();
int str2 = ((String) o2).length();
if (str1 > str2) {
return -1;
} else if(str1 == str2) {
return 0;
} else if (str1 < str2) {
return 1;
}
return Integer.MAX_VALUE;
}
}

47
Semester 3/Assignments/Lab_ChloeFontenot_MaximumOrderedString/src/main/java/edu/slcc/asdv/chloe/lab_calebfontenot_maximumorderedstring/FindMax.java
View File

@@ -1,47 +0,0 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package edu.slcc.asdv.chloe.lab_chloefontenot_maximumorderedstring;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.Scanner;
/**
*
* @author chloe
*/
public class FindMax {
public static String findMax(String input) {
int iterationCount = 0;
ArrayList<String> possibleSubStr = new ArrayList<>();
String currentStr = "";
for (int i = 0; i < input.length() -2; ++i) {
currentStr = input.charAt(i) + "";
for(int j = i + 1; j < input.length() -1; ++j) {
iterationCount++;
if (input.toLowerCase().charAt(i) < input.toLowerCase().charAt(j)) {
currentStr += input.charAt(j);
} else {
possibleSubStr.add(currentStr);
break;
}
}
}
System.out.println("Iteration count: " + iterationCount);
System.out.println(possibleSubStr);
Collections.sort(possibleSubStr, new CompareSize());
return possibleSubStr.get(0);
}
public static void main(String[] args)
{
//System.out.print("Enter a string: ");
//Scanner input = new Scanner(System.in);
String inputString = "abcdabcdefgzabcdefadcdefab";
//input.nextLine();
System.out.print("The maximum sorted subString is: ");
System.out.println(findMax(inputString));
}
}

38
Semester 3/Assignments/Lab_ChloeFontenot_MaximumOrderedString/src/main/java/edu/slcc/asdv/chloe/lab_calebfontenot_maximumorderedstring/FindMaxOrderedSubstring.java
View File

@@ -1,38 +0,0 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package edu.slcc.asdv.chloe.lab_chloefontenot_maximumorderedstring;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
/**
*
* @author chloe
*/
public class FindMaxOrderedSubstring {
public static String findMaxOrderedSubString(String input) {
String outputString = "";
int j = 0;
for (int i = 0; i < input.length(); ++i) {
if (i == 0) {
outputString += input.charAt(i);
}
if (input.charAt(i) > outputString.charAt(j)) {
System.out.println(++j);
outputString += input.charAt(i);
}
}
return outputString;
}
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter a string: ");
String inputStr = input.nextLine();
System.out.println(findMaxOrderedSubString(inputStr));
}
}

105
Semester 3/Assignments/Lab_ChloeFontenot_MaximumOrderedString/src/main/java/edu/slcc/asdv/chloe/lab_calebfontenot_maximumorderedstring/GenericMergeSort.java
View File

@@ -1,105 +0,0 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package edu.slcc.asdv.chloe.lab_chloefontenot_maximumorderedstring;
/**
*
* @author chloe
*/
import java.util.Comparator;
public class GenericMergeSort {
public static <E extends Comparable<E>> void mergeSort(E[] list)
{
mergeSort(list,
new Comparator<E>() {
@Override
public int compare(E e1, E e2)
{
return ((Comparable<E>) e1).compareTo(e2);
}
});
}
static int recursiveCallCount = 0;
public static <E> void mergeSort(E[] list,
Comparator<? super E> comparator)
{
if (list.length > 1) {
recursiveCallCount++;
// Merge sort the first half
E[] firstHalf = (E[]) new Object[list.length / 2];
System.arraycopy(list, 0, firstHalf, 0, list.length / 2);
mergeSort(firstHalf, comparator);
// Merge sort the second half
int secondHalfLength = list.length - list.length / 2;
E[] secondHalf = (E[]) new Object[secondHalfLength];
System.arraycopy(list, list.length / 2,
secondHalf, 0, secondHalfLength);
mergeSort(secondHalf, comparator);
// Merge firstHalf with secondHalf
E[] temp = merge1(firstHalf, secondHalf, comparator);
System.arraycopy(temp, 0, list, 0, temp.length);
}
}
private static <E> E[]
merge1(E[] list1, E[] list2, Comparator<? super E> comparator)
{
E[] temp = (E[]) new Object[list1.length + list2.length];
int current1 = 0; // Index in list1
int current2 = 0; // Index in list2
int current3 = 0; // Index in temp
while (current1 < list1.length && current2 < list2.length) {
if (comparator.compare(list1[current1], list2[current2]) < 0) {
temp[current3++] = list1[current1++];
} else {
temp[current3++] = list2[current2++];
}
}
while (current1 < list1.length) {
temp[current3++] = list1[current1++];
}
while (current2 < list2.length) {
temp[current3++] = list2[current2++];
}
return temp;
}
public static void main(String[] args)
{
Integer[] list
= {
2, 3, 2, 5, 6, 1, -2, 3, 14, 12
};
mergeSort(list);
System.out.println("number of recursive calls: " + recursiveCallCount);
recursiveCallCount = 0;
for (int i = 0; i < list.length; i++) {
System.out.print(list[i] + " ");
}
System.out.println();
String[] list1
= {
"ABC", "abc", "abm", "Anf", "Good", "Bad", "nice"
};
mergeSort(list1, (s1, s2) -> s1.compareToIgnoreCase(s2));
System.out.println("number of recursive calls: " + recursiveCallCount);
recursiveCallCount = 0;
for (int i = 0; i < list1.length; i++) {
System.out.print(list1[i] + " ");
}
}
}

56
Semester 3/Assignments/Lab_ChloeFontenot_MaximumOrderedString/src/main/java/edu/slcc/asdv/chloe/lab_calebfontenot_maximumorderedstring/JudeFindMax.java
View File

@@ -1,56 +0,0 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
* Click nbfs://nbhost/SystemFileSystem/Templates/Classes/Class.java to edit this template
*/
package edu.slcc.asdv.chloe.lab_chloefontenot_maximumorderedstring;
/**
*
* @author chloe
*/
public class JudeFindMax {
public static void main(String[] args) {
System.out.println(consecLetters("abcabcdgabxy"));
System.out.println(consecLetters("abcabcdgabmnsxy"));
System.out.println(consecLetters("abchjsfhajshfhijklmnopqjfaksfhkajhsf"));
System.out.println(consecLetters("hnafffgardghikortmmnmnmn"));
}
public static String consecLetters(String input)
{
String consec = "";
String maxConsec = "";
for (int i = 1; i < input.length(); i++) //n - 1
{
//If two in order
if (input.charAt(i) > input.charAt(i - 1))
{
//If length is zero then add previous as well
if (consec.length() == 0)
consec += input.charAt(i - 1);
consec += input.charAt(i);
}
//If not in order
else
{
//Check current consec length against maximum length
if (consec.length() > maxConsec.length())
{
//set new max
maxConsec = consec;
}
consec = "";
}
}
//Check current consec length against maximum length
if (consec.length() > maxConsec.length())
{
//set new max
maxConsec = consec;
}
return "Most letters found in order: " + maxConsec;
}
}

16
Semester 3/Assignments/Lab_ChloeFontenot_MaximumOrderedString/src/main/java/edu/slcc/asdv/chloe/lab_calebfontenot_maximumorderedstring/Lab_CalebFontenot_MaximumOrderedString.java
View File

@@ -1,16 +0,0 @@
/*
* Click nbfs://nbhost/SystemFileSystem/Templates/Licenses/license-default.txt to change this license
*/
package edu.slcc.asdv.chloe.lab_chloefontenot_maximumorderedstring;
/**
*
* @author chloe
*/
public class Lab_ChloeFontenot_MaximumOrderedString {
public static void main(String[] args) {
System.out.println("Hello World!");
}
}