Votre défi aujourd'hui est d'écrire un programme ou une fonction qui prend une liste let donne les positions dans llesquelles chaque élément successif de ltri apparaît.

En d'autres termes, sortez l'index de la plus petite valeur, suivi de l'index de la deuxième plus petite valeur, etc.

Vous pouvez supposer que le tableau d'entrée ne contiendra que des entiers positifs et contiendra au moins un élément.

Cas de test:

Input                  | Output (1-indexed)
[7, 4, 5]              | [2, 3, 1]
[1, 2, 3]              | [1, 2, 3]
[2, 6, 1, 9, 1, 2, 3]  | [3, 5, 1, 6, 7, 2, 4]
[4]                    | [1]

Lorsque deux éléments ou plus ayant la même valeur apparaissent, leurs indices doivent apparaître côte à côte du plus petit au plus grand.

C'est le code-golf , le moins d'octets gagne!

Gelée , 1 octet

Ụ

Essayez-le en ligne!

Dyalog APL, 1 octet

⍋

Dyalog APL a une fonction opérateur intégrée (merci Zacharý d'avoir clarifié cela) pour ce faire.

Exemple

⍋11 2 4 15
    2 3 1 4  
{⍵[⍋⍵]}11 4 2 15
    2 4 11 15

Ici, je suis indexé dans la liste par les indices triés pour retourner la liste dans l'ordre croissant.

Haskell , 43 42 octets

1-indexé:

import Data.List
map snd.sort.(`zip`[1..])

Essayez-le en ligne!

-1 byte merci à @ ØrjanJohansen!

Python 2 , 56 octets

Cette solution est indexée 0. Cela abuse du fait que sorted()crée une copie de la liste d'origine.

l=input()
for k in sorted(l):a=l.index(k);print a;l[a]=0

Essayez-le en ligne!

Javascript (ES6), 39 octets

-2 octets grâce à @powelles

Cela ne fonctionne que dans les navigateurs où Array.prototype.sortest stable.

a=>[...a.keys()].sort((b,c)=>a[b]-a[c])

Version 1 indexée (47 octets):

a=>a.map((_,i)=>i+1).sort((b,c)=>a[b-1]-a[c-1])

Exemple d'extrait de code:

f=
a=>[...a.keys()].sort((b,c)=>a[b]-a[c])
console.log("7,4,5 => "+f([7,4,5]))
console.log("1,2,3 => "+f([1,2,3]))
console.log("2,6,1,9,1,2,3 => "+f([2,6,1,9,1,2,3]))
console.log("4 -> "+f([4]))

Python 2 , 48 octets

lambda x:sorted(range(len(x)),key=x.__getitem__)

Essayez-le en ligne!

Perl 6 ,  27  21 octets

*.pairs.sort(*.value)».key

Essaye-le

->\x{sort {x[$_]},^x}

Essaye-le

Inspiré d'une réponse Python

Étendu:

->    # pointy block lambda
  \x  # declare sigilless parameter
{
  sort
    { x[$_] },  # sort by the value in ｢x｣ at the given position
    ^x          # Range up-to the number of elements in ｢x｣
}

Bash + coreutils, 20

nl|sort -nk2|cut -f1

Try it online.

Swift 4, 82 bytes

func f(l:[Int]){var l=l;for k in l.sorted(){let a=l.index(of:k)!;print(a);l[a]=0}}

Test Suite.

Explanation

In Swift, l.sorted() creates a sorted copy of the original Array. We loop through the sorted elements in the list and after printing each item's index in the original Array with let a=l.index(of:k)!;print(a), and then, in order to keep the correct indexes in the Array, we assign l[a] to 0, because it does not affect our normal output.

Take note that this is 0-indexed, since it is a port of my Python solution. If you want it to be 1-indexed, replace print(a) with print(a+1) or Try it online!.

R, 5 bytes

There is a builtin function for this.

order

Ruby, 40 bytes

->a{a.zip([*1..a.size]).sort.map &:last}

Try it online!

MATL, 2 bytes

&S

Try it online!

Input and output are implicit.

J, 2 bytes

/:

Try it online!

Zero-based indexing.

Octave, 17 bytes

@(i)[~,y]=sort(i)

Try it online!

Octave is like MATLAB but with inline assignment, making things possible that gives the folks at Mathworks HQ headaches. It doesn't matter what you call y, but you can't do without that dummy variable, as far as I know.

MY, 3 bytes

MY also has a builtin for this!

⎕⍋↵

Try it online!

How?

Evaluated input, grade up, then output with a newline.

Indexed however you set the index, with ⌶/0x48. (Can even be some weird integer like -1 or 2, the default is 1).

Java 8, 128 + 19 = 147 bytes

Based on Mr. Xcoder's solution. 0-based. Lambda takes input as an Integer[] and returns Integer[]. Byte count includes lambda expression and required import.

import java.util.*;

l->{Integer o[]=l.clone(),s[]=l.clone(),i=0;for(Arrays.sort(s);i<l.length;)l[o[i]=Arrays.asList(l).indexOf(s[i++])]=0;return o;}

Try It Online

Ungolfed lambda

l -> {
    Integer
        o[] = l.clone(),
        s[] = l.clone(),
        i = 0
    ;
    for (Arrays.sort(s); i < l.length; )
        l[o[i] = Arrays.asList(l).indexOf(s[i++])] = 0;
    return o;
}

Notes

I use Integer[] instead of int[] to allow use of Arrays.asList, which has no primitive versions. Integer is preferred to Long because values are used as array indices and would require casting.

This ended up being shorter than my best procedural-style List solution because of the cost of class and method names.

This also beat a solution I tried that streamed the inputs, mapped to (value, index) pairs, sorted on values, and mapped to indices, mostly because of the baggage needed to collect the stream.

Acknowledgments

• -5 bytes thanks to Nevay

Common Lisp, 82 bytes

(lambda(l)(loop as i in(sort(copy-seq l)'<)do(setf(elt l(print(position i l)))0)))

Try it online!

Clojure, 39 bytes

#(map key(sort-by val(zipmap(range)%)))

CJam, 12 bytes

{ee{1=}$0f=}

Try it online!

MATLAB / Octave, 29 bytes

[~,y]=sort(input(''));disp(y)

Try it online!

JavaScript (ES6), 69 bytes

0-indexed. Works for lists containing up to 65,536 elements.

a=>[...a=a.map((n,i)=>n<<16|i)].sort((a,b)=>a-b).map(n=>a.indexOf(n))

Test cases

let f =

a=>[...a=a.map((n,i)=>n<<16|i)].sort((a,b)=>a-b).map(n=>a.indexOf(n))

console.log(JSON.stringify(f([7, 4, 5])))
console.log(JSON.stringify(f([1, 2, 3])))
console.log(JSON.stringify(f([2, 6, 1, 9, 1, 2, 3])))
console.log(JSON.stringify(f([4])))

Python 3, 52 bytes

0-indexed. Based on Bruce Forte's Haskell answer here and G B's Ruby answer here.

lambda l:list(zip(*sorted(zip(l,range(len(l))))))[1]

Try it online!

Husk, 10 7 bytes

This is a direct port of my Haskell answer, also 1-indexed:

m→O`z,N

Try it online!

Ungolfed/Explained

Code        Description               Example
         -- implicit input            [2,6,1]
      N  -- natural numbers           [1,2,3,..]
   `z,   -- zip, but keep input left  [(2,1),(6,2),(1,3)]
  O      -- sort                      [(1,3),(2,1),(6,2)]
m→       -- keep only indices         [3,1,2]

Java (OpenJDK 8), 72 bytes

l->l.stream().sorted().map(i->{int j=l.indexOf(i);l.set(j,0);return j;})

Try it online!

Takes a List<Integer>, returns a Stream<Integer> containing the results.

We get a Stream based off the initial list, sort it, then map each number to it's index in the list. In order to accommodate duplicate elements, we set the original element in the list to 0.

SmileBASIC, 67 bytes

DEF I(A)DIM B[0]FOR I=1TO LEN(A)PUSH B,I
NEXT
SORT A,B
RETURN B
END

Very simple, all it does is generate a list of numbers from 1 to (length of array) and sort this by the same order as the input.

Python 3 with Numpy, 38 26 bytes

12 bytes saved thanks to Jo King (no need to give the function a name)

import numpy
numpy.argsort

Output is 0-based.

Try it online!

05AB1E, 4 bytes

ā<Σè

Try it online!

Pari/GP, 16 bytes

a->vecsort(a,,1)

Try it online!

PHP, 54 bytes

<?php function i($a){asort($a);return array_keys($a);}

Try it online!

This is zero-indexed. Simply sorts the array and returns the keys.

Tcl, 21 bytes

(0-indexed)

puts [lsort -indi $L]

Try it online!