OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: Update comments to English from Hindi in sudoku_solve.cpp (#1273)

Browse Source 
Co-authored-by: saurav <sauravUppoor@users.noreply.github.com>
This commit is contained in:
Saurav Uppoor 2020-10-13 23:43:03 +05:30 committed by GitHub
parent 895ae31cd7
commit 5a7120165e
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
backtracking/sudoku_solve.cpp
View File

@ -22,7 +22,7 @@
*/ */
namespace backtracking { namespace backtracking {
/** /**
* Checks if it's possible to place a 'no' * Checks if it's possible to place a number 'no'
* @tparam V number of vertices in the array * @tparam V number of vertices in the array
* @param mat matrix where numbers are saved * @param mat matrix where numbers are saved
* @param i current index in rows * @param i current index in rows
@ -34,14 +34,14 @@ namespace backtracking {
*/ */
template <size_t V> template <size_t V>
bool isPossible(const std::array <std::array <int, V>, V> &mat, int i, int j, int no, int n) { bool isPossible(const std::array <std::array <int, V>, V> &mat, int i, int j, int no, int n) {
/// Row or col nahin hona chahiye /// 'no' shouldn't be present in either row i or column j
for (int x = 0; x < n; x++) { for (int x = 0; x < n; x++) {
if (mat[x][j] == no || mat[i][x] == no) { if (mat[x][j] == no || mat[i][x] == no) {
return false; return false;
} }
} }
/// Subgrid mein nahi hona chahiye /// 'no' shouldn't be present in the 3*3 subgrid
int sx = (i / 3) * 3; int sx = (i / 3) * 3;
int sy = (j / 3) * 3; int sy = (j / 3) * 3;
@ -91,7 +91,7 @@ namespace backtracking {
bool solveSudoku(std::array <std::array <int, V>, V> &mat, int i, int j) { bool solveSudoku(std::array <std::array <int, V>, V> &mat, int i, int j) {
/// Base Case /// Base Case
if (i == 9) { if (i == 9) {
/// Solve kr chuke hain for 9 rows already /// Solved for 9 rows already
backtracking::printMat<V>(mat, 9); backtracking::printMat<V>(mat, 9);
return true; return true;
} }
@ -109,17 +109,17 @@ namespace backtracking {
/// Try to place every possible no /// Try to place every possible no
for (int no = 1; no <= 9; no++) { for (int no = 1; no <= 9; no++) {
if (backtracking::isPossible<V>(mat, i, j, no, 9)) { if (backtracking::isPossible<V>(mat, i, j, no, 9)) {
/// Place the no - assuming solution aa jayega /// Place the 'no' - assuming a solution will exist
mat[i][j] = no; mat[i][j] = no;
bool aageKiSolveHui = backtracking::solveSudoku<V>(mat, i, j + 1); bool solution_found = backtracking::solveSudoku<V>(mat, i, j + 1);
if (aageKiSolveHui) { if (solution_found) {
return true; return true;
} }
/// Nahin solve hui /// Couldn't find a solution
/// loop will place the next no. /// loop will place the next no.
} }
} }
/// Sare no try kr liey, kisi se bhi solve nahi hui /// Solution couldn't be found for any of the numbers provided
mat[i][j] = 0; mat[i][j] = 0;
return false; return false;
} }