Skip to content

Fix typos in comments #2457

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
siriak merged 3 commits into from
Oct 4, 2021
Merged

Fix typos in comments #2457

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
2f723ac
Fix typos in comments
Manan-Rathi Oct 3, 2021
d4a0f0d
Fix typos in comments
Manan-Rathi Oct 3, 2021
0ae49d1
Merge branch 'master' into fix-typos
siriak Oct 4, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions Conversions/OctalToHexadecimal.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -51,10 +51,10 @@ public static void main(String args[]) {
// Take octal number as input from user in a string
String oct = input.next();

// Pass the octal number to function and get converted deciaml form
// Pass the octal number to function and get converted decimal form
int decimal = octToDec(oct);

// Pass the decimla number to function and get converted Hex form of the number
// Pass the decimal number to function and get converted Hex form of the number
String hex = decimalToHex(decimal);
System.out.println("The Hexadecimal equivalant is: " + hex);
input.close();
Expand Down
4 changes: 2 additions & 2 deletions DynamicProgramming/RegexMatching.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,7 @@
**/

/**
* For calculation Time and Space Complexity. Let N be length of src and M be length of pat
* For calculation of Time and Space Complexity. Let N be length of src and M be length of pat
**/

public class RegexMatching {
Expand Down Expand Up @@ -168,4 +168,4 @@ public static void main(String[] args) {

}
// Memoization vs Tabulation : https://www.geeksforgeeks.org/tabulation-vs-memoization/
// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1
// Question Link : https://practice.geeksforgeeks.org/problems/wildcard-pattern-matching/1
2 changes: 1 addition & 1 deletion Sorts/BitonicSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,7 +44,7 @@ void bitonicSort(int a[], int low, int cnt, int dir) {
// sort in descending order since dir here is 0
bitonicSort(a, low + k, k, 0);

// Will merge wole sequence in ascending order
// Will merge whole sequence in ascending order
// since dir=1.
bitonicMerge(a, low, cnt, dir);
}
Expand Down
2 changes: 1 addition & 1 deletion Sorts/PancakeSort.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,7 +3,7 @@
import static Sorts.SortUtils.*;

/**
* Implementation of gnome sort
* Implementation of pancake sort
*
* @author Podshivalov Nikita (https://github.com/nikitap492)
* @since 2018-04-10
Expand Down