[
Lists Home |
Date Index |
Thread Index
]
> performance part 1. using xlstproc (xmlsoft.org)
>
> stylesheet approx 50k
>
> xml in approximate doublings in size from 24k to 3.25M (7 test files)
>
> the processing time goes up by a factor approx 4 for every
> doubling in
> size - looks o(n2) to me.
I'm not sure why you're telling us this. We all know that it is possible to
write an O(n^2) program in any language of sufficient power. And it doesn't
need 50K (bytes? lines?) of code to do it.
Michael Kay
http://www.saxonica.com/
|