64
edits
Changes
m
Call graph
�
Call graph
�
→Assignment 1
granularity: each sample hit covers 2 byte(s) no time propagated
[19] 0.0 0.00 0.00 1 __static_initialization_and_destruction_0(int, int) [19]
-----------------------------------------------
Index by function name
[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)
'''Analysis'''
The analysis reveals that the program took no time in solving this puzzle. However, the function placeNum was called the most. The function solveSudoku is used for inserting values into empty elements, and placeNum does the testing whether or not the value is correct. For a deeper analysis, a harder puzzle must be used.
granularity: each sample hit covers 2 byte(s) for 0.06% of 17.42 seconds
[20] 0.0 0.00 0.00 1 __static_initialization_and_destruction_0(int, int) [20]
-----------------------------------------------
Index by function name
[5] checkColumn(int, int) [19] __static_initialization_and_destruction_0(int, int) [4] checkRow(int, int)
[6] checkSquare(int, int, int) [20] __static_initialization_and_destruction_0(int, int) [3] placeNum(int, int)
'''Analysis'''
