How to resolve the algorithm Variable declaration reset step by step in the jq programming language

Published on 12 May 2024 09:40 PM
#Jq

How to resolve the algorithm Variable declaration reset step by step in the jq programming language

Table of Contents

Problem Statement

A decidely non-challenging task to highlight a potential difference between programming languages. Using a straightforward longhand loop as in the JavaScript and Phix examples below, show the locations of elements which are identical to the immediately preceding element in {1,2,2,3,4,4,5}. The (non-blank) results may be 2,5 for zero-based or 3,6 if one-based. The purpose is to determine whether variable declaration (in block scope) resets the contents on every iteration. There is no particular judgement of right or wrong here, just a plain-speaking statement of subtle differences. Should your first attempt bomb with "unassigned variable" exceptions, feel free to code it as (say) If your programming language does not support block scope (eg assembly) it should be omitted from this task.

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Variable declaration reset step by step in the jq programming language

Source code in the jq programming language

[1,2,2,3,4,4,5]
| . as $array
| range(1;length)
| select( $array[.] == $array[.-1])

  

You may also check:How to resolve the algorithm Multiple distinct objects step by step in the Z80 Assembly programming language
You may also check:How to resolve the algorithm IBAN step by step in the C# programming language
You may also check:How to resolve the algorithm Permutation test step by step in the R programming language
You may also check:How to resolve the algorithm Loops/Continue step by step in the Icon and Unicon programming language
You may also check:How to resolve the algorithm Goldbach's comet step by step in the Rust programming language