From 7e16a576bc2207caf236b11baf7707069aa38f7a Mon Sep 17 00:00:00 2001 From: Ankur Date: Sun, 4 Jun 2023 18:52:32 +0530 Subject: [PATCH] Fix codespell errors --- algorithms/C/maths/odd-or-even-number.c | 4 ++-- algorithms/CPlusPlus/Sorting/bubble-sort.cpp | 2 +- algorithms/Python/graphs/bfs-sequence.py | 2 +- 3 files changed, 4 insertions(+), 4 deletions(-) diff --git a/algorithms/C/maths/odd-or-even-number.c b/algorithms/C/maths/odd-or-even-number.c index 2cd3553b..8df048ee 100644 --- a/algorithms/C/maths/odd-or-even-number.c +++ b/algorithms/C/maths/odd-or-even-number.c @@ -3,7 +3,7 @@ * * Odd numbers are whole numbers that cannot be divided exactly by 2. If the number is not divisible by 2 entirely, * it'll leave a remainder 1. - * Even numbers are whole numbers that can be divided exactly by 2. If we divide the number by 2, it'll leave a remander 0. + * Even numbers are whole numbers that can be divided exactly by 2. If we divide the number by 2, it'll leave a remainder 0. * * Complexity -> O(1) * _______________________________ @@ -29,4 +29,4 @@ int main() } return 0; -} \ No newline at end of file +} diff --git a/algorithms/CPlusPlus/Sorting/bubble-sort.cpp b/algorithms/CPlusPlus/Sorting/bubble-sort.cpp index e8cf0c59..bce16856 100644 --- a/algorithms/CPlusPlus/Sorting/bubble-sort.cpp +++ b/algorithms/CPlusPlus/Sorting/bubble-sort.cpp @@ -18,7 +18,7 @@ int main() { swap = false; for (int j= 0; j< n-1; j++) - { //comparing adjecent elements of array + { //comparing adjacent elements of array if (arr[j]>arr[j+1]) { // swapping array elements temp = arr[j]; diff --git a/algorithms/Python/graphs/bfs-sequence.py b/algorithms/Python/graphs/bfs-sequence.py index d50acad1..8884ddf4 100644 --- a/algorithms/Python/graphs/bfs-sequence.py +++ b/algorithms/Python/graphs/bfs-sequence.py @@ -33,7 +33,7 @@ def Display_BFS(curr:int ,Adj_Dict: dict[int, list[int]]) -> None: # displays BF queue.append(i) visited.append(i) rear+=1 - queue[front]=-1 # all nodes adjecent to curr are visited + queue[front]=-1 # all nodes adjacent to curr are visited front+=1 if front==rear: # no new node to visit return