hi, can anyone help me to improve this function in order to be faster? right now it takes about 300micro sec to execute and it it used every second. I've found this page Code Review: Division of Integers by Constants but i don't know how to port it on 32bit unsigned integer In the code below th…

Fast Modulo help needed

gvi70000 September 16, 2012, 8:02pm 3

i have also other functions on the run i want to save speed and memory

Topic		Replies	Views
Fast modulo for unsigned 32 bit. - prime sieve 2 demo Libraries	1	1364	May 6, 2021
Fastest U32 divide by 10 routine 3rd Party Boards	38	16447	May 6, 2021
divu5() and divu3(). Fast replacements for unsigned division by 3, 5, 6, 10, 15 Libraries	17	16487	May 6, 2021
modulo - unexpected behaviour Syntax & Programs	6	2345	May 6, 2021
Exploring millis() Libraries	31	13665	May 6, 2021