== Progress ==
== Assignment 1 ==
=== SudokuMP by Marko R ===
SudokuMP solves sudoku puzzles given a txt file arranging the puzzle and the size of the puzzle. There are two methods to solve said puzzles the brute force method and the humanistic solver. Profiling wasn't performed on the humanistic solver since it manages to solve all the 16x16 puzzles extremely quickly the worst of them still being under 12ms. The project can be found here: [https://github.com/bendebebe/SudokuMP SudokuMP]
0.00 1.23 0.00 59777 0.00 0.00 update_stack(Board*)
0.00 1.23 0.00 24 0.00 0.00 std::__deque_buf_size(unsigned long)
==== 16x16 easy 2 ====
Command line: ./sudoku src/16x16/easy2.txt 16
Before : After :
00 00 00 00 | 13 00 12 00 | 03 00 05 00 | 00 08 01 10 09 16 06 02 | 13 04 12 07 | 03 11 05 15 | 14 08 01 10
01 00 15 04 | 09 00 16 14 | 13 12 00 00 | 06 00 00 03 01 07 15 04 | 09 05 16 14 | 13 12 10 08 | 06 11 02 03
00 13 00 05 | 00 00 00 10 | 00 09 00 02 | 07 12 00 00 11 13 03 05 | 01 08 06 10 | 14 09 04 02 | 07 12 15 16
08 00 00 00 | 00 15 02 00 | 00 01 06 00 | 00 00 04 00 08 14 10 12 | 03 15 02 11 | 07 01 06 16 | 05 13 04 09
----------------------------------------------------- -----------------------------------------------------
00 04 00 00 | 00 00 00 00 | 00 00 00 05 | 02 00 00 14 16 04 07 09 | 06 10 15 12 | 11 08 01 05 | 02 03 13 14
00 00 01 06 | 00 00 00 00 | 15 13 00 14 | 00 00 16 12 03 08 01 06 | 11 02 04 09 | 15 13 07 14 | 10 05 16 12
00 12 00 00 | 00 00 00 08 | 00 03 00 04 | 01 00 07 00 10 12 11 13 | 16 14 05 08 | 02 03 09 04 | 01 06 07 15
00 00 00 15 | 00 03 01 00 | 16 00 00 10 | 00 04 08 11 05 02 14 15 | 07 03 01 13 | 16 06 12 10 | 09 04 08 11
----------------------------------------------------- -----------------------------------------------------
00 00 00 00 | 00 00 08 16 | 00 04 00 01 | 00 14 00 00 12 03 02 10 | 15 07 08 16 | 09 04 13 01 | 11 14 05 06
00 15 00 00 | 00 06 09 00 | 10 05 11 00 | 00 16 12 01 04 15 08 07 | 14 06 09 02 | 10 05 11 03 | 13 16 12 01
00 11 09 00 | 00 00 00 00 | 08 00 00 00 | 00 02 03 07 06 11 09 16 | 10 01 13 05 | 08 15 14 12 | 04 02 03 07
13 00 00 00 | 00 12 11 00 | 06 02 16 07 | 00 00 00 00 13 01 05 14 | 04 12 11 03 | 06 02 16 07 | 15 09 10 08
----------------------------------------------------- -----------------------------------------------------
00 10 12 00 | 00 13 03 00 | 04 00 15 00 | 16 00 00 05 14 10 12 08 | 02 13 03 06 | 04 07 15 09 | 16 01 11 05
02 00 04 00 | 00 00 07 01 | 00 00 00 06 | 00 00 14 13 02 09 04 11 | 05 16 07 01 | 12 10 03 06 | 08 15 14 13
00 00 00 03 | 08 09 00 00 | 01 16 02 11 | 12 10 00 00 07 05 13 03 | 08 09 14 15 | 01 16 02 11 | 12 10 06 04
00 00 16 01 | 12 11 00 00 | 05 14 00 00 | 03 07 09 00 15 06 16 01 | 12 11 10 04 | 05 14 08 13 | 03 07 09 02
Link to full profile : [http://pastebin.com/gbz2ZCTP FULL]
Flat Profile :
Each sample counts as 0.01 seconds.
no time accumulated
% cumulative self self total
time seconds seconds calls Ts/call Ts/call name
0.00 0.00 0.00 975 0.00 0.00 clear_number(Board*, int, Align, int)
0.00 0.00 0.00 633 0.00 0.00 Board* const& std::forward<Board* const&>(std::remove_reference<Board* const&>::type&)
0.00 0.00 0.00 325 0.00 0.00 update_solution(Board*, int, int, int)
0.00 0.00 0.00 217 0.00 0.00 std::_Deque_iterator<Board*, Board*&, Board**>::_Deque_iterator(std::_Deque_iterator<Board*, Board*&, Board**> const&)
0.00 0.00 0.00 213 0.00 0.00 std::deque<Board*, std::allocator<Board*> >::end()
0.00 0.00 0.00 211 0.00 0.00 Board::Board(int)
0.00 0.00 0.00 211 0.00 0.00 void __gnu_cxx::new_allocator<Board*>::destroy<Board*>(Board**)
0.00 0.00 0.00 211 0.00 0.00 _ZN9__gnu_cxx13new_allocatorIP5BoardE9constructIS2_IRKS2_EEEvPT_DpOT0_
0.00 0.00 0.00 211 0.00 0.00 std::_Deque_iterator<Board*, Board*&, Board**>::operator*() const
0.00 0.00 0.00 211 0.00 0.00 std::deque<Board*, std::allocator<Board*> >::empty() const
0.00 0.00 0.00 211 0.00 0.00 std::stack<Board*, std::deque<Board*, std::allocator<Board*> > >::empty() const
0.00 0.00 0.00 211 0.00 0.00 std::_Deque_iterator<Board*, Board*&, Board**>::operator--()
0.00 0.00 0.00 211 0.00 0.00 std::enable_if<std::__and_<std::allocator_traits<std::allocator<Board*> >::__destroy_helper<Board*>::type>::value, void>::type std::allocator_traits<std::allocator<Board*> >::_S_destroy<Board*>(std::allocator<Board*>&, Board**)
0.00 0.00 0.00 211 0.00 0.00 std::enable_if<std::__and_<std::allocator_traits<std::allocator<Board*> >::__construct_helper<Board*, Board* const&>::type>::value, void>::type std::allocator_traits<std::allocator<Board*> >::_S_construct<Board*, Board* const&>(std::allocator<Board*>&, Board**, Board* const&)
0.00 0.00 0.00 211 0.00 0.00 void std::allocator_traits<std::allocator<Board*> >::destroy<Board*>(std::allocator<Board*>&, Board**)
0.00 0.00 0.00 211 0.00 0.00 decltype (_S_construct({parm#1}, {parm#2}, (forward<Board* const&>)({parm#3}))) std::allocator_traits<std::allocator<Board*> >::construct<Board*, Board* const&>(std::allocator<Board*>&, Board**, Board* const&)
0.00 0.00 0.00 211 0.00 0.00 std::deque<Board*, std::allocator<Board*> >::back()
0.00 0.00 0.00 211 0.00 0.00 std::deque<Board*, std::allocator<Board*> >::pop_back()
0.00 0.00 0.00 211 0.00 0.00 std::deque<Board*, std::allocator<Board*> >::push_back(Board* const&)
0.00 0.00 0.00 211 0.00 0.00 std::stack<Board*, std::deque<Board*, std::allocator<Board*> > >::pop()
0.00 0.00 0.00 211 0.00 0.00 std::stack<Board*, std::deque<Board*, std::allocator<Board*> > >::top()
0.00 0.00 0.00 211 0.00 0.00 std::stack<Board*, std::deque<Board*, std::allocator<Board*> > >::push(Board* const&)
0.00 0.00 0.00 211 0.00 0.00 bool std::operator==<Board*, Board*&, Board**>(std::_Deque_iterator<Board*, Board*&, Board**> const&, std::_Deque_iterator<Board*, Board*&, Board**> const&)
0.00 0.00 0.00 211 0.00 0.00 operator new(unsigned long, void*)
0.00 0.00 0.00 210 0.00 0.00 update_stack(Board*)
0.00 0.00 0.00 210 0.00 0.00 choose_cell_bf(Board*, int&, int&)
0.00 0.00 0.00 210 0.00 0.00 create_copy_board(Board*)
0.00 0.00 0.00 210 0.00 0.00 Board::~Board()
0.00 0.00 0.00 24 0.00 0.00 std::__deque_buf_size(unsigned long)
==== 16x16 medium 1 ====
----
=== '''ColorTransferby Jadrian S''' ===
The Source code can be found [https://github.com/tatsy/ImageProcessing/tree/master/ColorTransfer here]
