-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Chapter2 my solutions #2
Conversation
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
rotate = error "rotate: Not implemented!" | ||
rotate :: Int -> [a] -> [a] | ||
rotate 0 xs = xs | ||
rotate n xs = take (length xs) (drop n (cycle xs)) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Is there a way to treat infinite lists effectively as rotate n xs = drop n xs
?
rewind = error "rewind: Not Implemented!" | ||
rewind :: [a] -> [a] | ||
rewind [] = [] | ||
rewind (x:xs) = (rewind xs)++[x] |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
In a procedural language I would swap the elements from the outer ends on inwards with a for loop. I wonder whether this implementation will scatter the list all over the stack?
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Signed-off-by: Melchior <[email protected]>
Solutions for Chapter {2}
cc @vrom911