How to resolve the algorithm Reverse words in a string step by step in the J programming language
How to resolve the algorithm Reverse words in a string step by step in the J 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 J programming language
Source code in the j programming language
([:;@|.[:<;.1 ' ',]);._2]0 :0
---------- Ice and Fire ------------
fire, in end will world the say Some
ice. in say Some
desire of tasted I've what From
fire. favor who those with hold I
... elided paragraph last ...
Frost Robert -----------------------
)
------------ Fire and Ice ----------
Some say the world will end in fire,
Some say in ice.
From what I've tasted of desire
I hold with those who favor fire.
... last paragraph elided ...
----------------------- Robert Frost
echo ;:inv@|.@cut;._2 {{)n
---------- Ice and Fire ------------
fire, in end will world the say Some
ice. in say Some
desire of tasted I've what From
fire. favor who those with hold I
... elided paragraph last ...
Frost Robert -----------------------
}}
You may also check:How to resolve the algorithm Regular expressions step by step in the Factor programming language
You may also check:How to resolve the algorithm Cut a rectangle step by step in the REXX programming language
You may also check:How to resolve the algorithm Substring/Top and tail step by step in the C++ programming language
You may also check:How to resolve the algorithm Compound data type step by step in the Transd programming language
You may also check:How to resolve the algorithm Walk a directory/Recursively step by step in the Scala programming language