Here's what the solution is, but I'm stuck since the max element could be negative.
public int scoresSpecial(int[] a, int[] b) {
return highSpecialScore(a) + highSpecialScore(b);
}
public int highSpecialScore(int[] a){
int max = 0;
for (int i = 0; i < a.length; i++){
if (max <...
The method below is intended to use an insertion sort. For example: if I had a String ArrayList of elements ("code", "computer", "area", "school"), it should sort the elements by insertion sort. I'm having a hard time understanding the logic, and have watched many videos.