Skip to content
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

Closed
wants to merge 19 commits into from
Closed

Chapter2 my solutions #2

wants to merge 19 commits into from

Conversation

melli79
Copy link
Owner

@melli79 melli79 commented Sep 29, 2023

Solutions for Chapter {2}

cc @vrom911

@melli79 melli79 self-assigned this Sep 29, 2023
rotate = error "rotate: Not implemented!"
rotate :: Int -> [a] -> [a]
rotate 0 xs = xs
rotate n xs = take (length xs) (drop n (cycle xs))
Copy link
Owner Author

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]
Copy link
Owner Author

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?

@melli79 melli79 closed this Oct 4, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant