shway
/
DSA
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Fix codespell errors

pull/1196/head
Ankur 2023-06-04 18:52:32 +05:30
parent af47764be0
commit 7e16a576bc
3 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
algorithms/C/maths/odd-or-even-number.c
View File

@ -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, * 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. * 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) * Complexity -> O(1)
* _______________________________ * _______________________________

2
algorithms/CPlusPlus/Sorting/bubble-sort.cpp
View File

@ -18,7 +18,7 @@ int main()
{ {
swap = false; swap = false;
for (int j= 0; j< n-1; j++) for (int j= 0; j< n-1; j++)
{ //comparing adjecent elements of array { //comparing adjacent elements of array
if (arr[j]>arr[j+1]) if (arr[j]>arr[j+1])
{ // swapping array elements { // swapping array elements
temp = arr[j]; temp = arr[j];

2
algorithms/Python/graphs/bfs-sequence.py
View File

@ -33,7 +33,7 @@ def Display_BFS(curr:int ,Adj_Dict: dict[int, list[int]]) -> None: # displays BF
queue.append(i) queue.append(i)
visited.append(i) visited.append(i)
rear+=1 rear+=1
queue[front]=-1 # all nodes adjecent to curr are visited queue[front]=-1 # all nodes adjacent to curr are visited
front+=1 front+=1
if front==rear: # no new node to visit if front==rear: # no new node to visit
return return