If you can make a microbenchmark to show this, it could be a nice blog post.
(Some recommendations: Make sure that the run time of each version is at least 1 or 2 seconds. Repeat the measurement 5 or 10 times, preferably in some pattern like ABABABABAB, Not AAAAABBBBB. Repeat this with different arrays sizes to have a guess of the complexity order and see if the reduction is constant on the startup time or is proportional to the total time. Make some graphics, graphics are nice.)