------- Additional Comments From belyshev at lubercy dot com 2004-11-27 01:45 ------- (In reply to comment #3) > Of course it's not very useful to claim that some algorithm > is O(N^x) when you don't say what N is...
N is number of nested loops. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=18595
