From 4a6af23713f7e44ba47d83207a0fed8cf99331b8 Mon Sep 17 00:00:00 2001 From: lkcl Date: Wed, 13 Apr 2022 11:22:14 +0100 Subject: [PATCH] --- openpower/sv/bitmanip/appendix.mdwn | 1 + 1 file changed, 1 insertion(+) diff --git a/openpower/sv/bitmanip/appendix.mdwn b/openpower/sv/bitmanip/appendix.mdwn index 30c1ad5a8..2796d7b40 100644 --- a/openpower/sv/bitmanip/appendix.mdwn +++ b/openpower/sv/bitmanip/appendix.mdwn @@ -5,6 +5,7 @@ links * * * +* nice-looking well-commented c++ implementation the most efficient division algorithm is probably Knuth's Algorithm D (with modifications from the exercises section of his book) which is O(n^2) and uses 2N-by-N-bit div/rem -- 2.30.2