Jump to: navigation, search

Algo holics

55 bytes added, 10:12, 8 March 2019
Sudoku Puzzle Solver by Gurpreet Singh
'''The call graph for the above execution looks like:'''
{| class="wikitable mw-collapsible mw-collapsed"
Call graph
granularity: each sample hit covers 2 byte(s) no time propagated
[9] checkColumn(int, int) [18] __static_initialization_and_destruction_0(int, int) [8] checkRow(int, int)
[11] checkSquare(int, int, int) [19] __static_initialization_and_destruction_0(int, int) [10] placeNum(int, int)
From the above Call graph we can see that the program took no time in finding the solution and the maximum number of calls were made to the checkRow, checkColumn and checkSquare function. However, to get a better understanding of the program let's try a harder Sudoku puzzle.
==== Simple Artificial Neural Network by Sukhbeer====

Navigation menu