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.

Sign up for GitHub

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

Jump to bottom

exercise 4.9 #18

Open

815095999 opened this issue Jul 17, 2020 · 1 comment

815095999 commented Jul 17, 2020

Why this implementation costs linear time?

When invoke new-ref, shouldn't it cost O(n) time?

Author

815095999 commented Jul 17, 2020 •

edited

Loading

ok, i see the comment.

But I think there's a solution to do this in O(1) time too. Just as the vector in C++ do.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment