Skip to content

Update README.md #36

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

Merged
merged 1 commit into from
Oct 31, 2019
Merged

Update README.md #36

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 4 additions & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -226,11 +226,13 @@ they take different time to complete.
Use Arrays when…
- You need to access data in random order fast (using an index).
- Your data is multi-dimensional (e.g., matrix, tensor).
- 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.

Use Linked Lists when:
- You will access your data sequentially.
- You want to save memory and only allocate memory as you need it.
- You want constant time to remove/add from extremes of the list.
- when size requirement is unknown - dynamic size advantage

---

Expand Down Expand Up @@ -394,7 +396,7 @@ From unbalanced BST to balanced BST

---

#### [Never get stuck solving a problem with 7 simple steps](book/part04-algorithmic-toolbox.asc)
#### [Never get stuck solving a problem with 8 simple steps](book/part04-algorithmic-toolbox.asc)

1. Understand the problem
1. Build a simple example (no edge cases yet)
Expand All @@ -403,6 +405,7 @@ From unbalanced BST to balanced BST
1. Optimize the solution
1. Write Code, yes, now you can code.
1. Test your written code
1. Analyse the complexity, both space and time and make sure to optimise further.

Full details [here](book/part04-algorithmic-toolbox.asc)

Expand Down