======PNCX======

=====algorithm: brute force / trial-by-division=====
====variant: naive====
The naive implementation is our baseline: implement with no awareness of potential tweaks, improvements, or optimizations. This should be the worst performing when compared to any optimization.

<code>
START TIMEKEEPING
NUMBER: FROM 2 THROUGH UPPERBOUND:
    ISPRIME <- YES
    FACTOR: FROM 2 THROUGH NUMBER-1:
        SHOULD FACTOR DIVIDE EVENLY INTO NUMBER:
            ISPRIME <- NO
    PROCEED TO NEXT FACTOR
    SHOULD ISPRIME STILL BE YES:
        INCREMENT OUR PRIME TALLY
PROCEED TO NEXT NUMBER
STOP TIMEKEEPING
</code>

====Future Proofing====

===Print Subroutine===

===Printing Seconds===
The amount of runtime a method takes can be measure in both cycle count and frame count. Since the cycle count resets every frame, frame count is needed for any time over 1/60th of a second

The Frame count can be added onto the cycle count to find a total time count. To do this the frame count needs to be multiplied by the number of cycles in a frame

Printing out the time can be separated into the whole portion and the fractional portion

The whole and fractional part can be found by dividing the cycle count by the amount of cycles in a unit of time (seconds for whole, milliseconds for fractional)

<code>
ADD FRAME TIME TO CYCLE TIME
DIVIDE THE CYCLE TIME BY THE CYCLES PER SECOND
PRINT THE WHOLE PORTION

MODULATE THE CYCLE TIME BY THE CYCLES PER SECOND
DIVIDE THE CYCLE TIME BY THE CYCLES PER MILLISECOND
   ADD ZEROS TO THE LEFT UNTIL STRING IS THE CORRECT LENGTH
PRINT THE FRACTIONAL PORTION
</code>
====variant: break on composite (BOC)====
====variant: odds-only processing====
====variant: sqrt point====

===How to Sqrt===

====variant: break+odds====

====variant: break+sqrt====

====variant: break+odds+sqrt====

=====ALGORITHM: sieve of eratosthenes=====

====variant: baseline soe====

<code>
START TIMEKEEPING
NUMBER: FROM 2 THROUGH UPPERBOUND:
    SHOULD THE NUMBER SLOT BE TRUE:
        VALUE AT NUMBER IS PRIME, INCREMENT TALLY
        MULTIPLE: FROM NUMBER+NUMBER THROUGH UPPERBOUND:
            VALUE AT MULTIPLE IS NOT PRIME
            MULTIPLE IS MULTIPLE PLUS NUMBER
        PROCEED TO NEXT MULTIPLE
    INCREMENT NUMBER
PROCEED TO NEXT NUMBER
STOP TIMEKEEPING
</code>

====variant: sieve of eratosthenes with sqrt trick (soes)====

<code>
START TIMEKEEPING
NUMBER: FROM 2 THROUGH NUMBER*NUMBER<UPPERBOUND:
    SHOULD THE NUMBER SLOT BE TRUE:
        VALUE AT NUMBER IS PRIME, INCREMENT TALLY
        MULTIPLE: FROM NUMBER*NUMBER THROUGH UPPERBOUND:
            VALUE AT MULTIPLE IS NOT PRIME
            MULTIPLE IS MULTIPLE PLUS NUMBER
        PROCEED TO NEXT MULTIPLE
    INCREMENT NUMBER
PROCEED TO NEXT NUMBER
STOP TIMEKEEPING
</code>
=====timing=====

=====Array in ASM=====

====wedge pnc1 runtimes====
<dataplot center linespoints smooth 600x400 xlabel="range" ylabel="time (s)">
1024 0.550 0.083 0.116 0.016 0.033 0.0 0.0 0.0
2048 2.233 0.300 0.516 0.066 0.133 0.016 0.016 0.0
4096 8.950 1.150 2.083 0.183 0.533 0.033 0.033 0.016
8192 35 4.200 8.383 0.533 1.966 0.100 0.116 0.050
</dataplot>
====Darkmoon pnc0 runtimes====
{{ :notes:comporg:spring2025:projects:dm_pnc0.png?600 |}}
====Darkmoon pnc1 runtimes====
{{ :notes:comporg:spring2025:projects:dm_pnc1.png?600 |}}
====Darkmoon pnc2 runtimes====
{{ :notes:comporg:spring2025:projects:dm_pnc2.png?600 |}}


====TommyK pnc0 runtimes====
{{ :notes:comporg:spring2025:projects:tommyk_pnc0.png?600 |}}
====TommyK pnc1 runtimes====
{{ :notes:comporg:spring2025:projects:tommyk_pnc1_linear.png?600 |}}
{{ :notes:comporg:spring2025:projects:tommyk_pnc1_log.png?600 |}}

====TommyK pnc2 runtimes====
{{ :notes:comporg:spring2025:projects:tommyk_pnc2_linear.png?600 |}}
{{ :notes:comporg:spring2025:projects:tommyk_pnc2_log.png?600 |}}

====BrandonD pnc0 runtimes====
{{ :notes:comporg:spring2025:projects:bd_pnc0.png?600 |}}

====BrandonD pnc1 runtimes====
{{ :notes:comporg:spring2025:projects:bd_pnc1graph.png?600 |}}

====BrandonD pnc2 runtimes====
{{ :notes:comporg:spring2025:projects:bd_pnc2graph.png?600 |}}