Yesterday’s blog went over stacks, queues, linked lists, graphs, & hash tables. Today I’ll explain the trade offs.
The trade off for linked lists is that by editing an element, may have to iterate through the whole length of code.
Hash tables are the fastest data structures, however the trade off is the correspondence of keys and values. It sacrifices relationship between data and not the best choice for just storing data.
This is just like the crypto currency space of trading security for speed. Which bitcoin is the most secure but slower than the unsecured alt coins.
Overall my understanding of data structures in a bigger picture sense was met.<div class='sharedaddy sd-block sd-like jetpack-likes-widget-wrapper jetpack-likes-widget-unloaded' id='like-post-wrapper-155635758-233-5d0773b08c456' data-src='https://widgets.wp.com/likes/#blog_id=155635758&post_id=233&origin=trilamanila.com&obj_id=155635758-233-5d0773b08c456' data-name='like-post-frame-155635758-233-5d0773b08c456'><h3 class="sd-title">Like this:</h3><div class='likes-widget-placeholder post-likes-widget-placeholder' style='height: 55px;'><span class='button'><span>Like</span></span> <span class="loading">Loading...</span></div><span class='sd-text-color'></span><a class='sd-link-color'></a></div>