116
edits
Changes
→Big-O Complexity
=== Big-O Complexity ===
For every pixel in a image, we will need to test it against every other pixel. This make it complexity of O(n^2). For example a 256x256 has 65536 pixel. Each pixel would have to be tested against 65536 pixels to find out the nearest corresponding pixel. '''So 65536 * 65536 = 4,294,967,296 checks!'''
=== Assignment 2 ===
=== Assignment 3 ===
