@@ -226,11 +226,13 @@ they take different time to complete.
226226Use Arrays when...
227227- You need to access data in random order fast (using an index).
228228- Your data is multi-dimensional (e.g., matrix, tensor).
229+ - when there is a limit on memory as the requirement of memory is less due to actual data being stored within the index in the array.
229230
230231Use Linked Lists when:
231232- You will access your data sequentially.
232233- You want to save memory and only allocate memory as you need it.
233234- You want constant time to remove/add from extremes of the list.
235+ - when size requirement is unknown - dynamic size advantage
234236
235237---
236238
@@ -394,7 +396,7 @@ From unbalanced BST to balanced BST
394396
395397---
396398
397- #### [ Never get stuck solving a problem with 7 simple steps] ( book/part04-algorithmic-toolbox.asc )
399+ #### [ Never get stuck solving a problem with 8 simple steps] ( book/part04-algorithmic-toolbox.asc )
398400
3994011 . Understand the problem
4004021 . Build a simple example (no edge cases yet)
@@ -403,6 +405,7 @@ From unbalanced BST to balanced BST
4034051 . Optimize the solution
4044061 . Write Code, yes, now you can code.
4054071 . Test your written code
408+ 1 . Analyse the complexity, both space and time and make sure to optimise further.
406409
407410Full details [ here] ( book/part04-algorithmic-toolbox.asc )
408411
0 commit comments