Jump to: navigation, search


88 bytes added, 13:07, 6 April 2019
Kernel Optimization Attempts
Change : Quickly finds one section that requires a single value in one spot, by checking all sections at once and remembering a single value
Theory : Similar to the previous Kernel, trying to remove the second loop
Result : Surprisingly slow, gains little benefit from the section logicand shared memory, yet is still required to count all values
{| class="wikitable mw-collapsible mw-collapsed"
! Notify (Kernel) - Determines a single section that has a limited value (removes section loop)
Change : Refactors the algorithm to count the
{| class="wikitable mw-collapsible mw-collapsed"
! CountDown - Counts down instead of revisiting numbersusing Int as Boolean Array

Navigation menu