Skip to content

commented #1

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

Open
tejashreecd wants to merge 4 commits into
base: master
Choose a base branch
from
Open

commented #1

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
6eb2b75
commented
tejashreecd Nov 16, 2016
80e902c
commented_permutation
tejashreecd Nov 16, 2016
181eb49
Merge pull request #3 from tejashreecd/tejashreecd-patch-2
tejashreecd Nov 16, 2016
dece0b8
Update AllPermutations.cpp
tejashreecd Nov 16, 2016
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 Backtracking/AllPermutations.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,8 +1,8 @@
#include <bits/stdc++.h>
using namespace std;

//permutation
void permute(string & str,int l, int r) {
if(l = r) {
if(l == r) {
cout << str << "\n";
}
for(int i=l;i<=r;i++) {
Expand Down
4 changes: 2 additions & 2 deletions Backtracking/RatInMaze.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -7,7 +7,7 @@ int mat[100][100],sol[100][100];
int isSafe(int i,int j,int n) {
return (i < n && j < n && mat[i][j]==1);
}

//printing the matrix
void print(int n) {
for(int i=0;i<n;i++)
{
Expand Down Expand Up @@ -47,4 +47,4 @@ int main(void) {
for(int j=0;j<n;j++)
cin >> mat[i][j];
solve(0,0,n);
}
}