8000 Fix a spelling mistake · datengx/swift-algorithm-club@a51f98a · GitHub
[go: up one dir, main page]
Skip to content

Commit a51f98a

Browse files
KeithMorningKeithMorning
authored
Fix a spelling mistake
change the `probablistic` to `probabilistic`
1 parent 4f9afe7 commit a51f98a

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎README.markdown

Lines changed: 1 addition & 1 deletion
< 4608 td data-grid-cell-id="diff-752180eb8dc62c50aabe89619582363f65cb62ee49284c846d82ed7fe156cd1b-149-149-0" data-selected="false" role="gridcell" style="background-color:var(--bgColor-default);text-align:center" tabindex="-1" valign="top" class="focusable-grid-cell diff-line-number position-relative diff-line-number-neutral left-side">149
Original file line numberDiff line numberDiff line change
@@ -145,7 +145,7 @@ Most of the time using just the built-in `Array`, `Dictionary`, and `Set` types
145145
### Lists
146146

147147
- [Linked List](Linked%20List/). A sequence of data items connected through links. Covers both singly and doubly linked lists.
148-
- [Skip-List](Skip-List/). Skip List is a probablistic data-structure with same logarithmic time bound and efficiency as AVL/ or Red-Black tree and provides a clever compromise to efficiently support search and update operations.
148+
- [Skip-List](Skip-List/). Skip List is a probabilistic data-structure with same logarithmic time bound and efficiency as AVL/ or Red-Black tree and provides a clever compromise to efficiently support search and update operations.
149

150150
### Trees
151151

0 commit comments

Comments
 (0)
0