HASKELL LIST HELP

HELLO

I HAVE A LIST sortList OF INTEGERS 1..n AND A LIST elemList OF n ELEMENTS. HERE'S WHAT I WANT TO DO:

sortList: [3,2,4,1]
elemList: ["HAX", "MY", "ANUS", "ONIICHAN"]

proggleSort sortList elemList
=>
["ANUS", "MY", "ONIICHAN" "HAX"]

HOW WOULD I IMPLEMENT THE proggleSort?


proggleSort (x:xs) elem = (elem !! (x-1)):proggleSort xs elem
proggleSort _ _         = []
5 seconds, did I do it right?

I'll assume you know how to progressively get each list element in order from first to last, how to append a new element to the end of a list, and basic file IO and string operations.

Take elemList and write each element to a text file, named 1.txt, 2.txt, and so on.

Then take sortList, convert each element to a string, append ".txt", open the corresponding file, and insert its contents onto the result list.

There are more elegant solutions to this problem, but this one will leave your teacher with little doubt it's your own work.

>>1
Use a {i real} programming language:
> (sort '("/b/" "to" "Back") (λ (x y) (char-ci>? (string-ref x 0) (string-ref x 1))))
'("Back" "to" "/b/")

>>3
Take elemList and write each element to a text file,
This is how I wanted to emulate state when I was learning Haskell.

>>4
Fuck off, ``lispfag''.

asked 53 mins ago

+--+ ^xarnfan29
|XF| 12 ^●1
+--+ 50% accept rate

>>1
proggleSort = map snd . sort . zip

>>8
YES THANK YOU FOR HASKELL "LOOK AND FEEL"
>>2 YOUR A FAGGOT

>>9
It's called point-less programming.

use lisp

>>11
>>4

>>8 doesn't work

proggleSort = (map snd . sort) `dot` zip
    where dot = (.).(.)

Don't change these.

Name:		Email:
Entire Thread Thread List