Hello dear friends.
Could someone say me the answers of the following algorithm questions or one of them please?
1 - Describe in pseudocode algorithm for,
- multiplication "a la russe"
- computation of [x] , x € R
2 - Analyze the number of reversing steps in the method used for solving the PANCAKES problem.
3 - Propose an algorithm to decide if two sequences of values can be obtained one from the other one by a single reversing step of a final subsequence (suffix).
Thanks so much for your answers, for your time in advance!