Search Results

Too much indexing Python is not a compiled language. Every time something is indexed, the Python interpreter will redo the index lookup. It cannot determine that a value is unchanged and there is no …

You've got inefficiency here: // Sum of a subarray, based on B(x, i, L) -- i is one-indexing public static double sum(double[] x, int i, int L) { return IntStream.range(i, i + L) …

You may be able to speed up the body of the loop using the sum function & list comprehension: mem = sum( timeTaken // v for v in proc_r ) But the real speed up won’t come until you realize you can …

Yes, there are a few things which can be done to speed up your code. You create local variables width and height. But then you don't use these variables. Instead you use for x in range(img.shape[1] …

The tests c.HP > 0 and c.Team != Team are probably blazingly fast tests. Location.Dist(c.GetLocation()) <= AttackRange probably involves the square-root of the sum of the squares of the difference of …

You are right to question your current approach. With 9 sets of data with 5 repeats of each, you would need 45 variables with your current approach. Using a list or dictionary for one dimension woul …

You are using a sledge-hammer to crack a peanut. Consider String[] splittedLetters = letters.split("");. The split() function takes a regular expression, so you are using the entire regular expressi …

It is probably cheating, but the bin(x) function would do most of the heavy lifting, converting x into a string of bits. Iterate in the reverse direction (via [::-1]) to match bits with their proper …

Multiple lines First off, don't try to do everything on one line. This line is doing way too much: x = str(np.reshape([random.randint(1, 3) for i in range(100)], (-1, 10)).tolist()).replace("[", ""). …

One issue with your approach is your memory usage is \$O(n^2)\$. You are building up the entire Pascal's Triangle, and subsequently printing it. If you simply want to print Pascal's Triangle, you do …

Bugs Mutable reference The constructor takes an iterable of iterables, validates the type & shape, and stores that reference. If the source is mutated, the shape of the array can become invalid. x = …

Prime Generation As mentioned by vnp, use the Sieve of Eratosthenes. In that implementation, use a BitSet(1_000_000) for efficient memory usage during your sieve; a sieve for primes up to one million …

Base-32 to Integer Enumerate Your loop ... _sum = 0 _pow = 0 for o in string: if o in alpha_to_num: index = alpha_to_num[o] else: index = 31 …

Modulo arithmetic might be expensive. Consider replacing: buf->tailOffset = (buf->tailOffset + 1) % buf->numElements; with something more along the form of: if (++buf->tailOffset == buf->numEleme …

Code Review While I understand you're looking for performance improvements, this is Code Review, so let's start with seeing if we can improve the code first -- including minor performance improvements …