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

[NEW ALGORITHM] UNROLL LINKED LIST #1850

Closed
2 tasks done
aditiverma-21 opened this issue Nov 10, 2024 · 0 comments
Closed
2 tasks done

[NEW ALGORITHM] UNROLL LINKED LIST #1850

aditiverma-21 opened this issue Nov 10, 2024 · 0 comments

Comments

@aditiverma-21
Copy link
Contributor

Unroll Linked List

About:

Unrolled linked lists are a variation where each node stores an array of elements rather than a single element, thus reducing the number of nodes and improving cache performance.
Potential Use Case: Efficient for applications requiring high cache performance, such as graphics rendering, or where linked lists are too slow due to frequent memory allocation.

Labels:

new algorithm, gssoc-ext, hacktoberfest, level2


Assignees:

  • Contributor in GSSoC-ext
  • Want to work on it
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants