Given an list of N integers, Insertion Sort will, for each element in the list starting from the second element: Compare the ele
ment with the previous element If the previous element is greater than the element in question (EIQ), push the index of the previous element up 1 Repeat step two with the element before the previous element, and so on. Once an element has been reached that is less than the EIQ, stop pushing and insert the EIQ into the spot ahead of this element (or at the beginning of the list, if it is reached instead).
1 answer:
You might be interested in
Answer:
Explanation:
The following code is written in Java. It uses for loops to loop through the array of characters, and uses IF statements to check if the symbols in the expression are balanced. If so it returns true, otherwise it breaks the function and returns false. Two test cases have been provided in the main method and the output can be seen in the attached image below.
import java.util.ArrayList;
class Brainly {
public static void main(String[] args) {
char[] exp = { '[', 'A', '*', '{', 'B', '(', 'C', 'D', ')', '}', ']'};
char[] exp2 = {'[', 'A', '*', '(', 'C', '}', ']'};
System.out.println(checkBalance(exp));
System.out.println(checkBalance(exp2));
}
public static boolean checkBalance(char exp[]) {
ArrayList<Character> symbols = new ArrayList<>();
for (char x: exp) {
if ((x =='[') || (x == '{') || (x == '(')) {
symbols.add(x);
}
if (x ==']') {
if (symbols.get(symbols.size()-1) == '[') {
symbols.remove(symbols.size()-1);
} else {
return false;
}
}
if (x =='}') {
if (symbols.get(symbols.size()-1) == '{') {
symbols.remove(symbols.size()-1);
} else {
return false;
}
}
if (x ==')') {
if (symbols.get(symbols.size()-1) == '(') {
symbols.remove(symbols.size()-1);
} else {
return false;
}
}
}
return true;
}
}
