#Aquamacs correct indentation code#

Many people writing C++ don't really understand the benefits I myself was writing C++ for a long time without really getting it. The C++ iterator syntax looks strange and counter-intuitive to many.

#Aquamacs correct indentation code#

Most importantly, being able to do all the above while producing binary code that beats what you'd write doing generics in plain C.

Or some other data structure you might not have envisioned.

Replacing that vector with a raw C array.

If you specify the data to be sorted as a 'begin' and an 'end' iterator, you get all this for free: One of the strengths of the STL iterator approach and what you might find in the header is that you can fairly easily replace the backing data structure. It might be suitable for something like a homework exercise in a data structures class, but my biggest objection to this is you've tied everything to sorting the entirety of a std::vector. Style 1Īnd it does not match your outer style: int numDigits(int n) Pick a style that everybody else uses (or one of the big religious groups) but stay consistent (this also helps when tools get involved having a unique style means the some tools may not work as effectively for you). Get into the habit of using expressive names. In real life where you have good consistent code reviews this would fail a code review and you would be told go go change it (especially on big code bases).

Yes i and 'j` were standard variable names for integer loop variables in fortran and old lecturers who can not get out of the old practice have carried this forward into their teaching of modern languages. Alternatives would be index, outerLoop etc. I like loop personally (But a lot of people think this is horrible because it does not expresses intention (I disagree with them)). Think of how many falso positives a search on i is going to give you.Īlso it gives no indication as to its use. Now you need to find all occurences of the variable 'i' to validate that they are being used in the correct array. Imagine the code gets longer over the years and you need to maintain it. Make your variables names unique and easy to find. If (max data(a, a + sizeof(a)/sizeof(int)) Void GetPartialSorted(std::queue q, int qcount, std::vector & data) Void GetPartialSorted(std::queue q, int qcount, std::vector & data) įor (int i = 0 i q, int qcount, std::vector & data, int digit) Void PutInQueues(std::queue q, int qcount, std::vector & data, int digit)

Int Partition(std::vector & data, int low, int high) Void QuickSort(std::vector & data, int low, int high) While (lowl ::const_iterator iter = tmp.begin() Void Merge(std::vector & data, int lowl, int highl, int lowr, int highr) Void MergeSort(std::vector & data, int low, int high)

useful for small lists and where swapping is expensive Std::vector::const_iterator iter = data.begin() Void swap(std::vector & data, int i, int j) Bubble Sort, Insertion Sort, Selection Sort,