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

Replaced recursive search algorithm with iterative algorithm. #1

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

Dfmaaa
Copy link

@Dfmaaa Dfmaaa commented Dec 2, 2022

It does the same thing but doesn't take up a lot of stack frames.

It does the same thing but doesn't take up a lot of stack frames.
@infraredCoding
Copy link
Owner

This actually seems quite good. I'll definitely test this out. Thanks a lot

@Dfmaaa
Copy link
Author

Dfmaaa commented Dec 2, 2022

Thanks! Also, I noticed you aren't using an AVL tree in Routes.c. Yes, I agree that it would increase insertion time but the search time would decrease. Isn't that good for this project?

@infraredCoding
Copy link
Owner

That'd be an interesting tradeoff. Practically, users would staticly define their routes. So, the insertion time shouldn't really be a problem. I haven't implemented an AVL yet but it seems like a viable option

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants