Skip to main content
Commonmark migration
Source Link

#SmileBASIC, 67 bytes

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.

#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.

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.

Source Link
12Me21
  • 6.8k
  • 1
  • 23
  • 40

#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.