Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit b97d983

Browse files
committed
Merge remote-tracking branch 'origin/main'
2 parents 9a7b338 + df976bc commit b97d983

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

‎README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -35,15 +35,15 @@ One interesting implementation is this algorithm to compute fibonacci sequences
3535

3636
It's also worth noting that I've implemented brute force search recursively here as opposed to the iterative approach in the Java [source](https://github.com/dev-xero/java-algorithms-exercise-practice/blob/main/src/PracticeAlgorithms.java)
3737
```python3
38-
def brute_fore_search(key: int, the_array: [int], index: int) -> int:
38+
def brute_force_search(key: int, the_array: [int], index: int) -> int:
3939
"""Returns the index of the key if present, otherwise -1 using brute force search"""
4040
if index == len(the_array):
4141
return -1
4242

4343
if the_array[index] == key:
4444
return index
4545

46-
return brute_fore_search(key, the_array, index + 1)
46+
return brute_force_search(key, the_array, index + 1)
4747
```
4848

4949
## Java Implementation

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /