Can I Obtain Array Bounds Using Native C Functions?

Using std::sort to Sort Arrays in C

This article addresses the use of the standard template library (STL) function std::sort to sort an array declared as int v[2000]. Additionally, it explores whether C offers a native way to obtain the beginning and ending indices of an array.

std::sort and Range-Based Sorting

To employ std::sort, you can leverage the range-based for loop introduced in C 11. This approach simplifies the sorting process:

<code class="cpp">int v[2000];
std::sort(std::begin(v), std::end(v));</code>

Where std::begin and std::end are utility functions that return iterators pointing to the first and one past the last element of a container or array, respectively.

Custom begin and end Functions

For earlier C versions, you can create your own begin and end functions:

<code class="cpp">template<class Cont>
typename Cont::iterator begin(Cont& c){
  return c.begin();
}

template<class Cont>
typename Cont::iterator end(Cont& c){
  return c.end();
}

template<class T, std::size_t N>
T* begin(T (&arr)[N]){
  return &arr[0];
}

template<class T, std::size_t N>
T* end(T (&arr)[N]){
  return arr + N;
}</code>

These functions overload the existing begin and end functions for containers and arrays, providing a consistent interface for accessing range boundaries.

The above is the detailed content of Can I Obtain Array Bounds Using Native C Functions?. For more information, please follow other related articles on the PHP Chinese website!