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.
I will use 0b to refer to binary numbers: ex: 0b1 = 1, 0b10 = 2
0b100 = 4 and 0b11 = 3
4+3 = 7
convert 7 to binary and you get 111.
Hope this helps, and May the Force Be With You!
<span>-Jabba</span>
I would guess that the answer is Rights.
Answer:
CASE
Explanation:
Case Structure is a mechanism that allows different executions when there are several distinct possible values for a single variable, and each value requires a different subsequent action depending on the value of the label.
Case structure is also a conditional control structure that appears in most modern programming languages and allows a selection to be made between several sets of program statements.
nu it would not but if they call microsoft to check it then yez the history would show up for them but dont try to make it notice able so they dont have to call
