Why doesn't C++ provide bound checking on array operations and if the programmer want to do it,?

Question

what steps are needed to prevent the problem of over running of an array in C++?

Answer 1

Because that costs execution time on every access. For code that is at the core of a CPU intensive process, this is a no-no. Requiring it would force everyone to use even if they did not want it.



The STL containers optionally provide checking. For the template vector, using array subscripting is not checked, but the member function at() is checked.



std::vector vi(3);

vi[0] = 2; // not bounds checked

vi.at(4) = 3; // bounds checked - will throw an exception

Answer 2

In java, there is array bound-checking but in C++, there is none.

If you want to avoid index out of bound error, you need to subtract 1 to the counter you are using since array starts at index 0.

Answer 3

in case you declare an array like int a[d3d944682a44259755d38e6d163e820d3d944682a44259755d38e6d163e820]; Then valid element indexes are 10 to 9. Any attempt different than this variety ought to offer strengthen an blunders. in many situations, Java, C# etc are equipped with remarkable run time help as a results of fact of which this kind of blunders would be thrown by making use of the run time equipment. the place as C, provides blunders which contain memory phase violation or unlawful get right of entry to of memory etc style blunders.