Skip to content

Spelling fixes #2

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

Closed
wants to merge 1 commit into from
Closed

Spelling fixes #2

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
6 changes: 3 additions & 3 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -50,10 +50,10 @@ Computers are very, very fast at manipulating vectors. They're so much faster
than pointer operations that comparisons of big-O notation for an algorithm
don't play out in practice.

## Operations in psuedocode
## Operations in pseudocode

The technique is applicable in all languages. This library is written in C++
but I will use psuedocode to explain how it works.
but I will use pseudocode to explain how it works.

* Empty tree

Expand Down Expand Up @@ -129,7 +129,7 @@ childdata(t,c) = { data(childnodes(c)) }
* Determine leaf nodes (those with no children):

First, build a vector of all the indices. Then remove those indices that are
also in `p`. The psuedocode below is a slow implementation; should be done as a
also in `p`. The pseudocode below is a slow implementation; should be done as a
single loop.

```
Expand Down