You are viewing a single comment's thread. Return to all comments →
Haskell :
rev [] = []
rev l = last l : rev (init l)
Is this efficient?
Yes or no, I woud like to know what makes efficient / inefficient and what concept could help me make it better
Seems like cookies are disabled on this browser, please enable them to open this website
Reverse a List
You are viewing a single comment's thread. Return to all comments →
Haskell :
rev [] = []
rev l = last l : rev (init l)
Is this efficient?
Yes or no, I woud like to know what makes efficient / inefficient and what concept could help me make it better