Swap every two elements in a list

Question

Challenge

Let's have a list L of n elements. The task is to swap every two elements in this list.

Constrains

the list L has at least two elements
size of the list L is a multiple of two (i.e. number of elements is even)

Example

input: [1,2,3,4,5,6]
output: [2,1,4,3,6,5]
input: [0,1,0,1]
output: [1,0,1,0]

Rules

this is code-golf challenge, so the shortest code wins
standard rules apply for your answer with default I/O rules, so you are allowed to use stdin/stdout, functions/method with the proper parameters and return-type, full programs
default Loopholes are forbidden.

Welcome to Code Golf and nice first question! For future reference, we recommend using the Sandbox to get feedback on challenge ideas before posting them to main — Mayube, Commented Nov 10, 2021 at 16:42
What types of elements must the list support? In particular, is it all right if a solution only works on lists of non-negative/unsigned integers? — DLosc, Commented Nov 10, 2021 at 17:36
Can we use a char[] array in a language like C? If so, there is a certain built-in that would make the answer very short (s***). — dingledooper, Commented Nov 11, 2021 at 0:29
Sure, go ahead. However, I'd say that if there are two solutions with the same length, then the more general one wins (the one that works for more inputs/datatypes). — matusf, Commented Nov 12, 2021 at 0:41

emanresu A · Accepted Answer · 2021-11-12 08:45:40Z

21

><>, 4 3 bytes

i#o

Try it online!

Lol, ><> ~~ties with~~ beats Jelly & 05AB1E. Terminates with an error.

-1 thanks to @Manny Queen.

How does it work?

     The instruction pointer (IP) is currently moving right
i    Take input as a character
 #   Reflect - The IP starts moving left
i    Take input again
  o  Output that
 #   Reflect - The IP starts moving right again
  o  Output the first input we took - the inputs are now swapped

And now, we're moving left and back at the start again on i + moving right. 
This loops forever (i.e. until erroring when we're out of input) 
because there is no halt instruction (;)
This is essentially executing "iioo" in an infinite loop.

edited Nov 12, 2021 at 8:45

answered Nov 10, 2021 at 19:12

emanresu A

39.2k5 gold badges95 silver badges224 bronze badges

\$\begingroup\$ no longer beats Vyxal \$\endgroup\$
– Wasif
Commented Nov 11, 2021 at 8:36
\$\begingroup\$ @wasif Oh well, still beats Jelly and osabie. \$\endgroup\$
– emanresu A
Commented Nov 11, 2021 at 9:14

Add a comment |

Aaroneous Miller · Accepted Answer · 2021-11-10 17:48:19Z

13

Vyxal `r`, 2 bytes

yY

Try it Online!

Explanation:

y  # Uninterleave
 Y # Interleave

answered Nov 10, 2021 at 17:48

Aaroneous Miller

9,5601 gold badge24 silver badges39 bronze badges

1

\$\begingroup\$ What does the r flag do? \$\endgroup\$
– ZippyMagician
Commented Nov 10, 2021 at 17:49
3

\$\begingroup\$ @ZippyMagician The r flag makes all commands take their arguments in reverse order. That doesn't affect y since it only has one argument, but it does affect Y, meaning that the program is essentially equivalent to y$Y, which swaps the halves before interleaving. \$\endgroup\$
– Aaroneous Miller
Commented Nov 10, 2021 at 17:53

Add a comment |

m90 · Accepted Answer · 2021-11-10 17:13:59Z

12

Python 3, 34 bytes

f=lambda l:l and l[1::-1]+f(l[2:])

Try it online!

When l is empty (which makes it falsy), return it directly. Otherwise, reverse the first two elements and make a recursive call for the rest.

answered Nov 10, 2021 at 17:13

m90

10.5k1 gold badge13 silver badges45 bronze badges

Add a comment |

AZTECCO · Accepted Answer · 2021-11-10 23:37:16Z

12

Haskell, 22 bytes

f(a:b:c)=b:a:f c
f x=x

Try it online!

answered Nov 10, 2021 at 23:37

AZTECCO

10.8k1 gold badge15 silver badges58 bronze badges

\$\begingroup\$ f=concatMap(reverse.take 2).iterate(drop 2) \$\endgroup\$
– Roman Czyborra
Commented Nov 22, 2021 at 21:13
2

\$\begingroup\$ @Roman Czyborra nice but there's nothing stopping iterate.. that way works fine \$\endgroup\$
– AZTECCO
Commented Nov 23, 2021 at 0:06

Add a comment |

xash · Accepted Answer · 2021-11-12 18:19:51Z

12

convey, 7 bytes

I knew I should have implemented SpaceChem's flipflop operator, then this would be 5 bytes. :-)

-6 byte by @Manny Queen

}?{
}~1

Try it online!

{ puts the input list on the conveyor, } prints the result. On the ? the elements try to go down if they can. On the ~ they will wait for 1 tick before going to the output, thus starting with the first item, every second element is delayed for two ticks.

13 bytes

},<
{@^
0"
1^

Try it online!

The lower loop 0"\1^ copies 0 1 0 1 … into choose @. The input is thus split into two paths. The right one takes a little bit longer, so the other number can overtake it before joining , again.

edited Nov 12, 2021 at 18:19

answered Nov 10, 2021 at 17:45

xash

11.3k1 gold badge14 silver badges39 bronze badges

\$\begingroup\$ The second one can be made shorter with some rearrangement. \$\endgroup\$
– m90
Commented Nov 11, 2021 at 6:56
\$\begingroup\$ This makes me want to learn convey. It looks awesome. \$\endgroup\$
– stanri
Commented Nov 11, 2021 at 18:33
\$\begingroup\$ @MannyQueen, m90 thanks! Multiple outputs are well defined when they don't fire at the same step, so this is a very neat solution! \$\endgroup\$
– xash
Commented Nov 12, 2021 at 18:21

Add a comment |

dingledooper · Accepted Answer · 2021-11-11 00:11:08Z

11

brainfuck, 9 bytes

,[>,.<.,]

Try it online!

answered Nov 11, 2021 at 0:11

dingledooper

22.7k1 gold badge34 silver badges124 bronze badges

Add a comment |

Mayube · Accepted Answer · 2021-11-18 17:44:39Z

10

Rust v1.37.0, 59 55 47 bytes

|a:&[_]|(0..).zip(a).map(|i|a[i.0^1]).collect()

Try it online!

-2 bytes thanks to ZippyMagician
-2 bytes thanks to alephalpha
-8 bytes thanks to (0..).zip(a)

Rust is not a golfy language...
Port of the C# and JS answers
v1.37.0 is the version available on TIO

Rust stable, 54 bytes

|a:&[_]|a.chunks(2).flat_map(|a|[a[1],a[0]]).collect()

Try it online!

Thanks to ZippyMagician for this slightly golfier answer on the latest version of Rust.

edited Nov 18, 2021 at 17:44

answered Nov 10, 2021 at 18:17

Mayube

11.6k2 gold badges47 silver badges91 bronze badges

1

\$\begingroup\$ If you don’t use tio's outdated version of rust, |a:&[i32]|a.chunks(2).flat_map(|a|[a[1],a[0]]).collect() is 3 bytes shorter \$\endgroup\$
– ZippyMagician
Commented Nov 11, 2021 at 1:22
\$\begingroup\$ If you do, 57 bytes \$\endgroup\$
– ZippyMagician
Commented Nov 11, 2021 at 1:24
1

\$\begingroup\$ I think you can use &[_] instead of &[i32]. \$\endgroup\$
– alephalpha
Commented Nov 11, 2021 at 1:36
\$\begingroup\$ @ZippyMagician I managed to outgolf your stable rust answer with TIO's outdated version of rust :P \$\endgroup\$
– Mayube
Commented Nov 18, 2021 at 17:44

Add a comment |

xnor · Accepted Answer · 2021-11-11 07:47:38Z

9

Python 2, 30 bytes

def f(a,b,*m):print b,a,;f(*m)

Try it online!

The function f takes input splatted like f(1,2,3,4,5,6), and prints the output space-separated, terminating with error.

34 bytes

lambda l:map(l.pop,len(l)/2*[1,0])

Try it online!

This works by alternating popping the elements at index 1 and index 0.

answered Nov 11, 2021 at 7:47

xnor

146k26 gold badges277 silver badges644 bronze badges

Add a comment |

att · Accepted Answer · 2021-11-28 07:22:43Z

7

Wolfram Language (Mathematica), 22 bytes

0<##<1||#2&&#&&#0@##3&

Try it online!

Input [L...], and returns in an And. Works on integer inputs.

Wolfram Language (Mathematica), 24 bytes

{}=={##}||#2&&#&&#0@##3&

Try it online!

Input [L...], and returns in an And. Works on non-boolean inputs.

Wolfram Language (Mathematica), 26 bytes

#2~##&~#&@@@#~Partition~2&

Try it online!

Input [L], and returns a list. Works.

edited Nov 28, 2021 at 7:22

answered Nov 10, 2021 at 18:36

att

20.9k2 gold badges16 silver badges59 bronze badges

\$\begingroup\$ #~Partition~2~Reverse~2& is –2 bytes, if the OP doesn't mind the extra braces in the output: {1, 2, 3, 4, 5, 6} ⟹ {{2, 1}, {4, 3}, {6, 5}} \$\endgroup\$
– theorist
Commented Nov 11, 2021 at 5:39
\$\begingroup\$ @theorist IMO, that doesn't output what the specs ask for - it outputs a list of pairs. \$\endgroup\$
– att
Commented Nov 11, 2021 at 6:50
\$\begingroup\$ Yeah, figured you'd say that :). Could you save anything using BlockMap instead of Partition? E.g., BlockMap[Reverse,#,2]& is 2 bytes shorter than #~Partition~2~Reverse~2&. And how would you implement your function in the MMA front end? E.g., list={1,2,3,4,5,6} #2~##&~#&@@@#~Partition~2&@list doesn't work. \$\endgroup\$
– theorist
Commented Nov 11, 2021 at 7:30
\$\begingroup\$ @theorist I initially thought about BlockMap, but arguments to the function are provided as a list, so ...@@# is required, making Partition with @@@ shorter. Use ##&[#2,#]& instead; I'm not sure why infix ##& is recognized in wolframscript but not in a notebook. \$\endgroup\$
– att
Commented Nov 11, 2021 at 7:36

Add a comment |

Rydwolf Programs · Accepted Answer · 2021-11-10 17:54:13Z

6

JavaScript (ES6), 23 bytes

x=>x.map((_,i)=>x[i^1])

The [i^1] is thanks to m90 in TNB

Try it online!

answered Nov 10, 2021 at 17:54

Rydwolf Programs

18.8k2 gold badges81 silver badges172 bronze badges

Add a comment |

hyper-neutrino · Accepted Answer · 2021-11-10 16:47:38Z

5

Python 3, 36 bytes

lambda a:sum(zip(a[1::2],a[::2]),())

Try it online!

answered Nov 10, 2021 at 16:47

hyper-neutrino♦

42.5k5 gold badges68 silver badges224 bronze badges

Add a comment |

loopy walt · Accepted Answer · 2021-11-11 00:17:03Z

5

Python 3 + numpy, 31 bytes

lambda m:m[~-(m==m).cumsum()^1]

Try it online!

Expects a numpy array. Most of the code is about avoiding referencing numpy directly, so we can avoid the explicit import. It then calculates the indices directly by xoring a counter with 1.

answered Nov 11, 2021 at 0:17

loopy walt

16.7k2 gold badges10 silver badges69 bronze badges

\$\begingroup\$ (m*0).argsort() should work for -2. \$\endgroup\$
– ovs
Commented Nov 13, 2021 at 16:02
1

\$\begingroup\$ @ovs, only up to len(m)==16. From 17 numpy uses an unstable sort algorithm by default. tio.run/##DcoxDoAgDADAnVd0bB1MjIvxNwyADLRNwQE/… \$\endgroup\$
– loopy walt
Commented Nov 13, 2021 at 16:11

Add a comment |

cnamejj · Accepted Answer · 2021-11-11 20:25:37Z

Ly, 7 bytes

ir[foo]

Try it online!

Pretty straightforward, but might be worth posting since it's almost pronounceable. :)

ir       -- read input codepoints into the stack, reverse the order
  [   ]  -- while the stack isn't empty
   foo   -- flip the top two entries and print as characters

Cubix, 14 bytes

[email protected]?i.o;o;.^

Try it online!

This is the first time I've tried to use Cubix, so I wouldn't be suprised if it's possible to do this with less code. It's a hard language to explain, since it's a 2D language where the code is wrapped around a cube. So the directions the instruction pointer take a hard to show in a description. I'll include a link to the online interpreter since it has a debug mode when you can see the way the code iterates through the cells.

But I'll try to explain it too...

[email protected]?i.o;o;.^ - code before it's wrapped on the cube...
    i          - (1) starts here, input a codepoint
     ?         - branch if top of stack, <0 "left", >0 "right"
  @            - "left" (true on EOF), halt program
             ^ - "right", set IP direction to "up"
     ?         - same branch, but coming from another direction
      i        - "right", input another codepoint
        o;     - output top of stack as char, pop it off stack
          o;   - repeat... code wraps back to (1)

The . characters are no-ops and are needed to place the other characters in the right position so they will wrap into place on the cube.

Here's a link to the online interpreter http://ethproductions.github.io/cubix/?code=Li5ALmk/aS5vO287Ll4=&input=MTIzNDU2Nzg=&speed=20

Noodle9 · Accepted Answer · 2021-11-10 18:57:07Z

4

C (clang), ^{53 \$\cdots\$ 43} 42 bytes

f(*l,n){*l^=l[1]^(l[1]=*l);n&&f(l+2,n-2);}

Try it online!

Inputs a pointer in an int array and the array's length (since pointers in C carry no length info).
Swaps every two elements in place.

edited Nov 10, 2021 at 18:57

answered Nov 10, 2021 at 17:13

Noodle9

20.2k3 gold badges20 silver badges45 bronze badges

1

\$\begingroup\$ this also modifies past the end of the array \$\endgroup\$
– att
Commented Nov 10, 2021 at 18:51
1

\$\begingroup\$ @att I know, what's the problem? \$\endgroup\$
– Noodle9
Commented Nov 10, 2021 at 18:57

Add a comment |

loopy walt · Accepted Answer · 2021-11-10 23:16:27Z

4

Python 3.8 (pre-release), 35 bytes

def f(m):*m[1:],_,m[::2]=*m,m[1::2]

Try it online!

In-place. Essentially a golfed version of m[1::2],m[::2]=m[::2],m[1::2]

answered Nov 10, 2021 at 23:16

loopy walt

16.7k2 gold badges10 silver badges69 bronze badges

1

\$\begingroup\$ Is there something special about the 3.8 prerelease? \$\endgroup\$
– Chris Bouchard
Commented Nov 11, 2021 at 1:17
\$\begingroup\$ @ChrisBouchard it just happens to be the latest version available on tio. The walrss operator can be useful for glfing. \$\endgroup\$
– loopy walt
Commented Nov 11, 2021 at 4:17
\$\begingroup\$ I guess TIO just hasn't updated their python in a while? 3.8 was fully released Oct 2019, 3.9 is the most recent full release, and 3.10 is the current pre-release. \$\endgroup\$
– Gavin S. Yancey
Commented Nov 11, 2021 at 20:06

Add a comment |

Giuseppe · Accepted Answer · 2021-11-11 02:16:54Z

4

R, 29 bytes

function(l)l[seq(!l)+2*1:0-1]

Try it online!

answered Nov 11, 2021 at 2:16

Giuseppe

28.7k3 gold badges31 silver badges104 bronze badges

3

\$\begingroup\$ As input is guaranteed to be of length at least 2, you can omit the !. \$\endgroup\$
– pajonk
Commented Nov 11, 2021 at 18:18

Add a comment |

G B · Accepted Answer · 2021-11-11 09:00:23Z

4

Ruby, 26 bytes

->l{r=-1;l.map{l[1^r+=1]}}

Try it online!

edited Nov 11, 2021 at 9:00

answered Nov 11, 2021 at 7:49

G B

22.2k1 gold badge20 silver badges53 bronze badges

Add a comment |

Galen Ivanov · Accepted Answer · 2021-11-12 07:51:40Z

4

J, 9 bytes

[:,_2|.\]

Try it online!

answered Nov 12, 2021 at 7:51

Galen Ivanov

21.1k3 gold badges23 silver badges61 bronze badges

Add a comment |

Conor O'Brien · Accepted Answer · 2021-11-12 22:52:31Z

4, 22 bytes

3.72082072152152072094

Try it online!

Readable + explanation:

3. 720 820 721 521 520 720 9 4
^^------------------------------ mandatory prefix
   ^^^-------------------------- initial input in cell 20
       ^^^-----------------^---- loop while cell 20 is nonzero
           ^^^------------------ input to cell 21
               ^^^-------------- output cell 21
                   ^^^---------- output cell 20
                       ^^^------ input to cell 20
                           ^---- end loop
                             ^-- exit

Corresponding Quartic program:

decl a, b
input a
loop a
  input b
  print b
  print a
  input a
end

Pedro Maimere · Accepted Answer · 2021-11-13 19:43:51Z

4

AWK, 43 41 bytes

{for(;++n<NF;n++)$n+=$(n+1)-($(n+1)=$n)}1

Thanks for Dominic van Essen for 2 less bytes!

Try it online!

{
for(;++n<NF;n++)        Starts a loop though the numbers.
                        n has to start as 1, because $0 is the whole line.
$n+=$(n+1)-($(n+1)=$n)  Swap the numbers two by two.
                        Readable: a += b - (b = a)
}
1                       Prints the line.

edited Nov 13, 2021 at 19:43

answered Nov 12, 2021 at 23:57

Pedro Maimere

9201 gold badge6 silver badges10 bronze badges

1

\$\begingroup\$ If you swap ++n for n=1 (same bytes), it'll also work for subsequent lines of input... (currently the second 'try it online' line fails) \$\endgroup\$
– Dominic van Essen
Commented Nov 13, 2021 at 18:22
\$\begingroup\$ You are right!! Thanks for that. \$\endgroup\$
– Pedro Maimere
Commented Nov 13, 2021 at 18:33
1

\$\begingroup\$ ...or 41 bytes if you don't care about subsequent lines (and I don't think you need to care about them here...) \$\endgroup\$
– Dominic van Essen
Commented Nov 13, 2021 at 18:39

Add a comment |

t-clausen.dk · Accepted Answer · 2021-11-14 08:06:38Z

4

T-SQL, 32 bytes

Input is a table variable

SELECT a FROM @ ORDER BY b+b%2*2

Try it online

edited Nov 14, 2021 at 8:06

answered Nov 12, 2021 at 13:53

t-clausen.dk

3,75412 silver badges16 bronze badges

Add a comment |

score 4 · Accepted Answer · 2021-11-28 06:25:44Z

4

CLC-INTERCAL, 95 67 bytes.

Why does CLC-INTERCAL 1.-94.-2 lack !1~.1'? I could have golfed off one byte.

DOCOMEFROM#9(1)DOWRITEIN.1+.2DDOCOMEFROM'.1~.1'~#1(9)DOREADOUT.2+.1

Copy and paste to try it online!

Usage

Each item of list must be in ONE to SIX FIVE FIVE THREE FIVE (inclusive); ZERO for end of list.
- Given from STDIN, delimited with a LF.
Outputs to STDOUT, as roman number.

Try these inputs

ONE
TWO
ONE
TWO
ZERO

ONE
TWO
THREE
FOUR
FIVE
SIX
ZERO

edited Nov 28, 2021 at 6:25

answered Nov 13, 2021 at 15:41

user100411

Add a comment |

Aiden Chow · Accepted Answer · 2021-11-30 06:49:23Z

4

Desmos, 39 38 bytes

l=[1...L.length]
f(L)=L[l-1+2mod(l,2)]

Try It On Desmos!

Try It On Desmos! - Prettified

edited Nov 30, 2021 at 6:49

answered Nov 11, 2021 at 6:53

Aiden Chow

13.7k1 gold badge16 silver badges55 bronze badges

Add a comment |

ovs · Accepted Answer · 2021-12-10 10:27:34Z

4

BQN, 10 9 bytes^SBCS

-1 byte thanks to Razetime!

⥊·⌽˘∘‿2��⥊

Run online!

∘‿2⥊𝕩 Reshape the input into a matrix with 2 columns and and the necessary number of rows.
⌽˘ Reverse horizontally (Swap the 2 columns).
⥊ Flatten into a vector.

An alternative using the Under operator at 10 bytes:

⌽˘⌾(∘‿2⊸⥊)

Try it online!

edited Dec 10, 2021 at 10:27

answered Dec 9, 2021 at 15:50

ovs

59.7k3 gold badges47 silver badges158 bronze badges

1

\$\begingroup\$ useful userscript: github.com/razetime/userscripts/blob/main/bqncgcc.user.js \$\endgroup\$
– Razetime
Commented Dec 10, 2021 at 10:10
1

\$\begingroup\$ @Rezetime thanks and thanks! I already read that Nothing is supposed to be useful in trains, now I see why \$\endgroup\$
– ovs
Commented Dec 10, 2021 at 10:28
\$\begingroup\$ TIL about using ∘ with Reshape, fascinating. \$\endgroup\$
– DLosc
Commented Jul 14, 2022 at 17:30

Add a comment |

hyper-neutrino · Accepted Answer · 2021-11-10 16:41:11Z

3

Jelly, 4 bytes

s2UF

Try It Online!

s2    Slices of length 2
  U   Reverse each
   F  Flatten

answered Nov 10, 2021 at 16:41

hyper-neutrino♦

42.5k5 gold badges68 silver badges224 bronze badges

Add a comment |

Kjetil S · Accepted Answer · 2021-11-10 16:46:40Z

3

Perl 5 -p, 21 bytes

s/(\S+) (\S+)/$2 $1/g

Try it online!

answered Nov 10, 2021 at 16:46

Kjetil S

5,92510 silver badges21 bronze badges

\$\begingroup\$ Almost identical in sed \$\endgroup\$
– Digital Trauma
Commented Nov 10, 2021 at 17:07
\$\begingroup\$ Very similar in Retina \$\endgroup\$
– Neil
Commented Nov 10, 2021 at 17:49
\$\begingroup\$ Similar solution in Pip, though it's not the shortest Pip solution \$\endgroup\$
– DLosc
Commented Nov 10, 2021 at 18:56

Add a comment |

Graham · Accepted Answer · 2021-11-10 17:29:58Z

3

APL+WIN, 17 bytes

Prompts for vector

,⌽((.5×⍴r),2)⍴r←⎕

Try it online! Thanks to Dyalog Classic

answered Nov 10, 2021 at 17:29

Graham

6,4261 gold badge14 silver badges11 bronze badges

Add a comment |

pxeger · Accepted Answer · 2021-11-10 17:36:23Z

3

Zsh, 18 bytes

for a b;<<<$b<<<$a

Attempt This Online!

answered Nov 10, 2021 at 17:36

pxeger

24k4 gold badges52 silver badges140 bronze badges

Add a comment |

Mayube · Accepted Answer · 2021-11-10 17:46:00Z

3

C# (.NET Core) with `Linq`, 32 26 bytes

a=>a.Select((n,i)=>a[i^1])

Try it online!

-8 bytes thanks to m90's witchcraft

C# (.NET Core), 73 bytes

a=>{for(int i=0,d=0;i<a.Length;i++){d=a[i];a[i]=a[++i];a[i]=d;}return a;}

Try it online!

edited Nov 10, 2021 at 17:46

answered Nov 10, 2021 at 17:34

Mayube

11.6k2 gold badges47 silver badges91 bronze badges

Add a comment |

Fmbalbuena · Accepted Answer · 2021-11-10 18:00:21Z

3

Add++, 57 bytes

a:?
b:0
n:0
m:3
`b
Ea,Ib=n,,b:1,,x:i,+1,Ib=m,,b:0,,Oi,,Ox

Try it online!

Input is the first argument.

edited Nov 10, 2021 at 18:00

answered Nov 10, 2021 at 17:06

Fmbalbuena

4,1671 gold badge9 silver badges52 bronze badges

Add a comment |

Swap every two elements in a list

Challenge

Constrains

Example

Rules

83 Answers 83

><>, 4 3 bytes

How does it work?

Vyxal r, 2 bytes

Python 3, 34 bytes

Haskell, 22 bytes

convey, 7 bytes

13 bytes

brainfuck, 9 bytes

Rust v1.37.0, 59 55 47 bytes

Rust stable, 54 bytes

Python 2, 30 bytes

Wolfram Language (Mathematica), 22 bytes

Wolfram Language (Mathematica), 24 bytes

Wolfram Language (Mathematica), 26 bytes

JavaScript (ES6), 23 bytes

Python 3, 36 bytes

Python 3 + numpy, 31 bytes

Ly, 7 bytes

Cubix, 14 bytes

C (clang), 53 \$\cdots\$ 43 42 bytes

Python 3.8 (pre-release), 35 bytes

R, 29 bytes

Ruby, 26 bytes

J, 9 bytes

4, 22 bytes

AWK, 43 41 bytes

T-SQL, 32 bytes

CLC-INTERCAL, 95 67 bytes.

Usage

Try these inputs

Desmos, 39 38 bytes

BQN, 10 9 bytesSBCS

Jelly, 4 bytes

Perl 5 -p, 21 bytes

APL+WIN, 17 bytes

Zsh, 18 bytes

C# (.NET Core) with Linq, 32 26 bytes

C# (.NET Core), 73 bytes

Add++, 57 bytes

Not the answer you're looking for? Browse other questions tagged code-golfarray or ask your own question.

Linked

Related

Hot Network Questions

Vyxal `r`, 2 bytes

C (clang), ^{53 \$\cdots\$ 43} 42 bytes

BQN, 10 9 bytes^SBCS

C# (.NET Core) with `Linq`, 32 26 bytes

Not the answer you're looking for? Browse other questions tagged
code-golf
array
or ask your own question.