Login | Register   
RSS Feed
Download our iPhone app
Browse DevX
Sign up for e-mail newsletters from DevX

By submitting your information, you agree that devx.com may send you DevX offers via email, phone and text message, as well as email offers about other products and services that DevX believes may be of interest to you. DevX will process your information in accordance with the Quinstreet Privacy Policy.

Tip of the Day
Language: C++
Expertise: Beginner
Jun 19, 2006



Building the Right Environment to Support AI, Machine Learning and Deep Learning

Using the Standard Library Algorithms with Arrays

Pointers may be used as iterators when using the standard library algorithms found in <algorithm>. Remember that the start iterator should point to the first element, while the finish iterator should point just beyond the last element. For example, this code sorts an array of integers:

////////// begin code
int numbers[10] = { ... };
std::sort(numbers, numbers + 10);
////////// end code
This code sorts using a custom comparison function:

////////// begin code

struct s {
    // ...

bool less_than(const s& s0, const s& s1)
    // return true if s0 should come before s1

// ...

s array[10];
// initialize array
std::sort(array, array + 10, less_than);

////////// end code
Kevin Spiteri
Comment and Contribute






(Maximum characters: 1200). You have 1200 characters left.



Thanks for your registration, follow us on our social networks to keep up-to-date