File tree 2 files changed +2
-2
lines changed
src/algorithms/uncategorized/knight-tour
2 files changed +2
-2
lines changed Original file line number Diff line number Diff line change @@ -190,7 +190,7 @@ Below is the list of some of the most used Big O notations and their performance
190
190
| ** O(1)** | 1 | 1 | 1 |
191
191
| ** O(log N)** | 3 | 6 | 9 |
192
192
| ** O(N)** | 10 | 100 | 1000 |
193
- | ** O(N log N)** | 30 | 60 | 9000 |
193
+ | ** O(N log N)** | 30 | 600 | 9000 |
194
194
| ** O(N^2)** | 100 | 10000 | 1000000 |
195
195
| ** O(2^N)** | 1024 | 1.26e+29 | 1.07e+301 |
196
196
| ** O(N!)** | 3628800 | 9.3e+157 | 4.02e+2567 |
Original file line number Diff line number Diff line change 4
4
* @return {number[][] }
5
5
*/
6
6
function getPossibleMoves ( chessboard , position ) {
7
- // Generate all knight moves (event those that goes beyond the board).
7
+ // Generate all knight moves (even those that go beyond the board).
8
8
const possibleMoves = [
9
9
[ position [ 0 ] - 1 , position [ 1 ] - 2 ] ,
10
10
[ position [ 0 ] - 2 , position [ 1 ] - 1 ] ,
You can’t perform that action at this time.
0 commit comments