How to use std sort to sort an array in C

Question

How to use standard template library std  sort   to sort an array declared as  int v 2000    Does C   provide some function that can get the begin and end index of an array

User · Answer

With the Ranges library that is coming in C  20  you can use  ranges  sort arr     directly  where arr is a builtin array

User · Answer

sorting method without std  sort      sorting myArray ascending int iTemp   0  for  int i   0  i  lt  ARRAYSIZE  i          for  int j   i   1  j  lt   ARRAYSIZE  j                     for descending sort change   lt   with   gt           if  myArray j   lt  myArray i                         iTemp   myArray i               myArray i    myArray j               myArray j    iTemp                      Run complete example    include  lt iostream gt     std  cout  std  endl    http   en cppreference com w cpp header iostream     include  lt cstdlib gt      srand    rand           http   en cppreference com w cpp header cstdlib     include  lt ctime gt        time                    http   en cppreference com w cpp header ctime      int main         const int ARRAYSIZE   10      int myArray ARRAYSIZE           populate myArray with random numbers from 1 to 1000     srand time 0        for  int i   0  i  lt  ARRAYSIZE  i                  myArray i    rand    1000   1                print unsorted myArray     std  cout  lt  lt   unsorted myArray     lt  lt  std  endl      for  int i   0  i  lt  ARRAYSIZE  i                  std  cout  lt  lt       lt  lt  i  lt  lt     - gt     lt  lt  myArray i   lt  lt  std  endl            std  cout  lt  lt  std  endl          sorting myArray ascending     int iTemp   0      for  int i   0  i  lt  ARRAYSIZE  i                  for  int j   i   1  j  lt   ARRAYSIZE  j                             for descending sort change   lt   with   gt               if  myArray j   lt  myArray i                                 iTemp   myArray i                   myArray i    myArray j                   myArray j    iTemp                                        print sorted myArray     std  cout  lt  lt   sorted myArray     lt  lt  std  endl      for  int i   0  i  lt  ARRAYSIZE  i                  std  cout  lt  lt       lt  lt  i  lt  lt     - gt     lt  lt  myArray i   lt  lt  std  endl            std  cout  lt  lt  std  endl       return 0

User · Answer

sort by number bool sortByStartNumber Player  amp p1  Player  amp p2        return p1 getStartNumber    lt  p2 getStartNumber        sort by string bool sortByName Player  amp p1  Player  amp p2        string s1   p1 getFullName        string s2   p2 getFullName        return s1 compare s2     -1

User · Answer

You can sort it std  sort v  v   2000

User · Answer

It is as simple as that nbsp     C   is providing you a function in STL  Standard Template Library  called sort which runs 20  to 50  faster than the hand-coded quick-sort   Here is the sample code for it s usage   std  sort arr  arr   size

User · Answer

you can use    std  sort v begin   v end

User · Answer

include  lt algorithm gt  static const size t v size   2000  int v v size      Fill the array by values std  sort v v v size      In C  11    include  lt algorithm gt   include  lt array gt  std  array lt int  2000 gt  v     Fill the array by values std  sort v begin   v end

User · Answer

Use the C   std  sort function    include  lt algorithm gt  using namespace std   int main       vector lt int gt  v 2000     sort v begin    v end

User · Answer

It is working  include lt iostream gt  using namespace std  void main         int a 5       int temp 0      cout lt  lt  Enter Values  lt  lt endl      for int i 0 i lt 5 i                  cin gt  gt a i             for int i 0 i lt 5 i                  for int j 0 j lt 5 j                          if a i  gt a j                                 temp a i                   a i  a j                   a j  temp                                    cout lt  lt  Asending Series  lt  lt endl      for int i 0 i lt 5 i                  cout lt  lt endl          cout lt  lt a i  lt  lt endl              for int i 0 i lt 5 i                  for int j 0 j lt 5 j                          if a i  lt a j                                 temp a i                   a i  a j                   a j  temp                                    cout lt  lt  Desnding Series  lt  lt endl      for int i 0 i lt 5 i                  cout lt  lt endl          cout lt  lt a i  lt  lt endl

User · Answer

you can use sort   in C   STL   sort   function Syntax       sort array name  array name size          So you use  sort v  v 2000

User · Answer

C   sorting using sort function   include  lt bits stdc   h gt   using namespace std   vector  lt int gt  v 100    int main       sort v begin    v end

User · Answer

In C  0x 11 we get std  begin and std  end which are overloaded for arrays    include  lt algorithm gt   int main      int v 2000     std  sort std  begin v   std  end v        If you don t have access to C  0x  it isn t hard to write them yourself      for container with nested typedefs  non-const version template lt class Cont gt  typename Cont  iterator begin Cont amp  c     return c begin       template lt class Cont gt  typename Cont  iterator end Cont amp  c     return c end          const version template lt class Cont gt  typename Cont  const iterator begin Cont const amp  c     return c begin       template lt class Cont gt  typename Cont  const iterator end Cont const amp  c     return c end          overloads for C style arrays template lt class T  std  size t N gt  T  begin T   amp arr  N      return  amp arr 0      template lt class T  std  size t N gt  T  end T   amp arr  N      return arr   N

User · Answer

If you don t know the size  you can use   std  sort v  v   sizeof v   sizeof v 0      Even if you do know the size  it s a good idea to code it this way as it will reduce the possibility of a bug if the array size is changed later

[c++] How to use std::sort to sort an array in C++

Examples related to c++

Examples related to sorting