Fix codespell errors
parent
af47764be0
commit
7e16a576bc
|
@ -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;
|
||||
}
|
||||
}
|
||||
|
|
|
@ -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];
|
||||
|
|
|
@ -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
|
||||
|
|
Loading…
Reference in New Issue