|
From: | anonymous |
Subject: | [Octave-bug-tracker] [bug #65244] Simplify code complexity of perms.cc |
Date: | Fri, 9 Feb 2024 11:54:51 -0500 (EST) |
Follow-up Comment #15, bug#65244 (group octave): It looks good to me. But it may be OK to have code duplication for different data structures. I haven't tested the patch but I think it imposes overhead on Octave numeric types. Currently GetPerms has complexity of n*log(n) and GetPermsNoSort has complexity of n^2. If I correctly understand the proposed patch makes the complexity of both function equal to n^2. _______________________________________________________ Reply to this item at: <https://savannah.gnu.org/bugs/?65244> _______________________________________________ Message sent via Savannah https://savannah.gnu.org/
[Prev in Thread] | Current Thread | [Next in Thread] |