This commit is contained in:
Manan-Rathi 2021-10-04 23:01:06 +05:30 committed by GitHub
parent a352a4905e
commit 374938c3f8
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
4 changed files with 6 additions and 6 deletions

View File

@ -51,10 +51,10 @@ public class OctalToHexadecimal {
// Take octal number as input from user in a string // Take octal number as input from user in a string
String oct = input.next(); 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); 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); String hex = decimalToHex(decimal);
System.out.println("The Hexadecimal equivalant is: " + hex); System.out.println("The Hexadecimal equivalant is: " + hex);
input.close(); input.close();

View File

@ -9,7 +9,7 @@ package DynamicProgramming;
**/ **/
/** /**
* 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 { public class RegexMatching {
@ -168,4 +168,4 @@ public class RegexMatching {
} }
// Memoization vs Tabulation : https://www.geeksforgeeks.org/tabulation-vs-memoization/ // 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

View File

@ -44,7 +44,7 @@ public class BitonicSort {
// sort in descending order since dir here is 0 // sort in descending order since dir here is 0
bitonicSort(a, low + k, k, 0); bitonicSort(a, low + k, k, 0);
// Will merge wole sequence in ascending order // Will merge whole sequence in ascending order
// since dir=1. // since dir=1.
bitonicMerge(a, low, cnt, dir); bitonicMerge(a, low, cnt, dir);
} }

View File

@ -3,7 +3,7 @@ package Sorts;
import static Sorts.SortUtils.*; import static Sorts.SortUtils.*;
/** /**
* Implementation of gnome sort * Implementation of pancake sort
* *
* @author Podshivalov Nikita (https://github.com/nikitap492) * @author Podshivalov Nikita (https://github.com/nikitap492)
* @since 2018-04-10 * @since 2018-04-10