How to resolve the algorithm Reverse words in a string step by step in the Maple programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Reverse words in a string step by step in the Maple programming language

Table of Contents

Problem Statement

Reverse the order of all tokens in each of a number of strings and display the result;   the order of characters within a token should not be modified.

Hey you, Bub!   would be shown reversed as:   Bub! you, Hey

Tokens are any non-space characters separated by spaces (formally, white-space);   the visible punctuation form part of the word within which it is located and should not be modified. You may assume that there are no significant non-visible characters in the input.   Multiple or superfluous spaces may be compressed into a single space. Some strings have no tokens, so an empty string   (or one just containing spaces)   would be the result. Display the strings in order   (1st, 2nd, 3rd, ···),   and one string per line. (You can consider the ten strings as ten lines, and the tokens as words.)

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Reverse words in a string step by step in the Maple programming language

Source code in the maple programming language

while (true) do
	input := readline("input.txt"):
	if input = 0 then break: fi:
	input := StringTools:-Trim(input): # remove leading/trailing space
	input := StringTools:-Join(ListTools:-Reverse(StringTools:-Split(input, " "))," "):
	printf("%s\n", input):
od:

  

You may also check:How to resolve the algorithm Mutual recursion step by step in the Ursala programming language
You may also check:How to resolve the algorithm Ackermann function step by step in the Joy programming language
You may also check:How to resolve the algorithm Sorting algorithms/Heapsort step by step in the EasyLang programming language
You may also check:How to resolve the algorithm Empty string step by step in the Standard ML programming language
You may also check:How to resolve the algorithm Compare a list of strings step by step in the Nanoquery programming language