I mean the best way to do it wound be O(nlog(n)) which would be a hastle to implement (or you use fancy libraries as other solutions do);

Nice way of checking for odd numbers, but the complexity of this algorithm is O(n^2) which is far from optimal (though it is space effecient).