How to resolve the algorithm Narcissist step by step in the Déjà Vu programming language

Published on 12 May 2024 09:40 PM

How to resolve the algorithm Narcissist step by step in the Déjà Vu programming language

Table of Contents

Problem Statement

Quoting from the Esolangs wiki page: For concreteness, in this task we shall assume that symbol = character. The narcissist should be able to cope with any finite input, whatever its length. Any form of output is allowed, as long as the program always halts, and "accept", "reject" and "not yet finished" are distinguishable.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Narcissist step by step in the Déjà Vu programming language

Source code in the déjà programming language

!. = !prompt "Enter my code: " concat( swap !decode!utf-8 !encode!quoted dup swap ) "!. = !prompt \qEnter my code: \q concat( swap !decode!utf-8 !encode!quoted dup swap ) "

  

You may also check:How to resolve the algorithm Rosetta Code/Count examples step by step in the LiveCode programming language
You may also check:How to resolve the algorithm Non-decimal radices/Output step by step in the J programming language
You may also check:How to resolve the algorithm Stream merge step by step in the Nim programming language
You may also check:How to resolve the algorithm Day of the week step by step in the Euphoria programming language
You may also check:How to resolve the algorithm Identity matrix step by step in the ooRexx programming language