How to resolve the algorithm Rot-13 step by step in the Déjà Vu programming language
How to resolve the algorithm Rot-13 step by step in the Déjà Vu programming language
Table of Contents
Problem Statement
Implement a rot-13 function (or procedure, class, subroutine, or other "callable" object as appropriate to your programming environment). Optionally wrap this function in a utility program (like tr, which acts like a common UNIX utility, performing a line-by-line rot-13 encoding of every line of input contained in each file listed on its command line, or (if no filenames are passed thereon) acting as a filter on its "standard input."
(A number of UNIX scripting languages and utilities, such as awk and sed either default to processing files in this way or have command line switches or modules to easily implement these wrapper semantics, e.g., Perl and Python). The rot-13 encoding is commonly known from the early days of Usenet "Netnews" as a way of obfuscating text to prevent casual reading of spoiler or potentially offensive material. Many news reader and mail user agent programs have built-in rot-13 encoder/decoders or have the ability to feed a message through any external utility script for performing this (or other) actions. The definition of the rot-13 function is to simply replace every letter of the ASCII alphabet with the letter which is "rotated" 13 characters "around" the 26 letter alphabet from its normal cardinal position (wrapping around from z to a as necessary). Thus the letters abc become nop and so on. Technically rot-13 is a "mono-alphabetic substitution cipher" with a trivial "key". A proper implementation should work on upper and lower case letters, preserve case, and pass all non-alphabetic characters in the input stream through without alteration.
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Rot-13 step by step in the Déjà Vu programming language
Source code in the déjà programming language
rot-13:
)
for ch in chars swap:
ord ch
if <= 65 dup:
if >= 90 dup:
+ 13 - swap 65
+ 65 % swap 26
if <= 97 dup:
if >= 122 dup:
+ 13 - swap 97
+ 97 % swap 26
chr
concat(
!print rot-13 "Snape kills Frodo with Rosebud."
You may also check:How to resolve the algorithm Associative array/Iteration step by step in the Sidef programming language
You may also check:How to resolve the algorithm Dynamic variable names step by step in the Nanoquery programming language
You may also check:How to resolve the algorithm Convert seconds to compound duration step by step in the uBasic/4tH programming language
You may also check:How to resolve the algorithm Sieve of Eratosthenes step by step in the Seed7 programming language
You may also check:How to resolve the algorithm MD5/Implementation step by step in the Lua programming language