Answer:
- import java.util.ArrayList;
- public class Main {
-
- public static void main(String[] args) {
- ArrayList<String> strList =new ArrayList<String>();
- strList.add("to");
- strList.add("be");
- strList.add("or");
- strList.add("not");
- strList.add("to");
- strList.add("be");
- strList.add("hamlet");
-
- swapPairs(strList);
- System.out.println(strList);
- }
-
- public static void swapPairs(ArrayList<String> list){
- for(int i=0; i < list.size()-1; i+=2){
- String temp = list.get(i);
- list.set(i, list.get(i+1));
- list.set(i+1, temp);
- }
- }
- }
Explanation:
Firstly, let's create a method swapPairs that take one ArrayList (Line 18). In the method, use a for-loop to traverse through each item in the ArrayList and swap the items between the current items at index-i and at index-i+1 (Line 19-22). The index-i is incremented by two in next loop and therefore the next swapping will proceed with third and fourth items and so forth.
In the main program, create a sample ArrayList (Line 5-12) and then test the method (Line 14) and print the output (Line 15). We shall get [be, to, not, or, be, to, hamlet].
Answer:
Algorithm for the above problem:
- Take a string from the user input.
- store the input string on any variable.
- Reverse the string and store it on the other variable.
- Compare both strings (character by character) using any loop.
- If all the character of the string matched then print that the "Input string is a palindrome".
- Otherwise, print "The inputted string is not a palindrome."
Output:
- If the user inputs "ababa", then it prints that the "Input string is palindrome"
- If the user inputs "ababaff", then it prints that the "Input string is not palindrome"
Explanation:
- The above-defined line is a set of an algorithm to check the number is palindrome or not.
- It is defined in English because the algorithm is a finite set of instructions written in any language used to solve the problem.
- The above algorithm takes input from the user, compare that string with its reverse and print palindrome, if the match is found.
Answer:
Downloading and/or Burning it on to your computer
Hope this helped! if so please mark it as brainliest
Explanation:
