double var = 0.; for(int i = 0; i < 1000000 ; i++) { var += sqrt(2.0); } std::cout << var << std::endl; Under MSVC2012, is it possible that under release with optimization turn on,...

I'm reading "Introduction to Algorithm" by CLRS. In chapter 2, the authors mention "loop invariants". What is a loop invariant?

As seen on Introduction to Algorithms (http://mitpress.mit.edu/algorithms), the exercise states the following: Input: Array A[1..n] and a value v Output: Index i, where A[i] = v or NIL if v does ...

Consider the standard strategy to solve the 100 prisoners and a lightbulb problem. Here's my attempt to model it in Dafny: method strategy<T>(P: set<T>, Special: T) returns (count: int...

For example, assuming a string s is this: for(int x = 0; x < s.length(); x++) better than this?: int length = s.length(); for(int x = 0; x < length; x++)

I have do an extensive calculation on a big vector of integers. The vector size is not changed during the calculation. The size of the vector is frequently accessed by the code. What is faster in g...

I have the following looking code in VC++: for (int i = (a - 1) * b; i < a * b && i < someObject->someFunction(); i++) { // ... } As far as I know compilers optimize all these ...

When using formal aspects to create some code is there a generic method of determining a loop invariant or will it be completely different depending on the problem?

I'm looking at Hoare Logic and I'm having problems understanding the method of finding the loop invariant. Can someone explain the method used to calculate the loop invariant? And what should a l...

In the following code: std::vector<int> var; for (int i = 0; i < var.size(); i++); Is the size() member function called for each loop iteration, or only once?

I have a loop that looks like this: for (int i = 0; i < dim * dim; i++) Is the condition in a for loop re-evaluated on every loop? If so, would it be more efficient to do something like t...