C String array sorting

Question

I am having so much trouble trying to figure out the sort function from the C   library and trying to sort this array of strings from a-z   help please     I was told to use this but I cant figure out what I am doing wrong       std  sort stringarray begin    stringarray end          include  lt iostream gt   include  lt string gt   include  lt algorithm gt  using namespace std   int main       int z   0    string name       john    bobby    dear                        test1    catherine    nomi                        shinta    martin    abe                        may    zeno    zack    angeal    gabby       sort name 0  name z       for int y   0  y  lt  z  y            cout  lt  lt  name z   lt  lt  endl        return 0

User · Answer

We can sort   function to sort string array    Procedure      At first determine the size string array  use sort function   sort array name  array name size  Iterate through string array      Code Snippet   include lt bits stdc   h gt  using namespace std   int main         ios  sync with stdio false        string name       john    bobby    dear    test1    catherine    nomi    shinta    martin    abe    may    zeno    zack    angeal    gabby         int len   sizeof name  sizeof name 0         sort name  name len        for string n  name                 cout lt  lt n lt  lt                cout lt  lt endl       return 0

User · Answer

As many here have stated  you could use std  sort to sort  but what is going to happen when you  for instance  want to sort from z-a  This code may be useful  bool cmp string a  string b    if a compare b   gt  0      return true  else     return false     int main     string words       this    a    test    is    int length   sizeof words    sizeof string   sort words  words   length  cmp    for int i   0  i  lt  length  i        cout  lt  lt  words i   lt  lt       cout  lt  lt  endl         output will be  this test is a       If you want to reverse the order of sorting just modify the sign in the cmp function   Hope this is helpful     Cheers

User · Answer

This works for me    include  lt iostream gt   include  lt string gt   include  lt algorithm gt   using namespace std   int main         string name       john    bobby    dear    test1    catherine    nomi    shinta    martin    abe    may    zeno    zack    angeal    gabby         int sname   sizeof name  sizeof name 0         sort name  name   sname        for int i   0  i  lt  sname    i          cout  lt  lt  name i   lt  lt  endl       return 0

User · Answer

The algorithms use iterator to the beginning and past the end of the sequence  That is  you want to call std  sort   something like this   std  sort std  begin name   std  end name      In case you don t use C  11 and you don t have std  begin   and std  end    they are easy to define yourself  obviously not in namespace std    template  lt typename T  std  size t Size gt  T  begin T   amp array  Size         return array    template  lt typename T  std  size t Size gt  T  end T   amp array  Size         return array   Size

User · Answer

The multiset container uses a red-black tree to keep elements sorted      using the multiset container to sort a list of strings   include  lt iostream gt   include  lt set gt   include  lt string gt   include  lt vector gt    std  vector lt std  string gt  people        Joe      Adam      Mark      Jesse      Jess      Fred      Susie      Jill      Fred      two freds     Adam      Jack      Adam      three adams     Zeke      Phil     int main int argc  char   argv      std  multiset lt std  string gt  g people begin    people end           sort      std  vector lt std  string gt  all sorted  g begin    g end       for  int i   0  i  lt  all sorted size    i          std  cout  lt  lt  all sorted i   lt  lt  std  endl          Sample Output   Adam Adam Adam Fred Fred Jack Jess Jesse Jill Joe Mark Phil Susie Zeke   Note the advantage is that the multiset stays sorted after insertions and deletions  great for displaying say active connections or what not

User · Answer

Your loop does not do anything because your counter z is 0  and 0  lt  0 evaluates to false  so the loop never starts     Instead  if you have access to C  11  and you really should aim for that   try to use iterators  e g  by using the non-member function std  begin   and std  end    and a range-for loop to display the result    include  lt iostream gt   include  lt string gt   include  lt algorithm gt  using namespace std   int main          int z   0      string name       john    bobby    dear    test1    catherine    nomi    shinta    martin    abe    may    zeno    zack    angeal    gabby         sort begin name  end name         for auto n  name            cout  lt  lt  n  lt  lt  endl            return 0          Live example

User · Answer

int z   sizeof name  sizeof name 0      Get the array size  sort name name z     Use the start and end like this  for int y   0  y  lt  z  y         cout  lt  lt  name y   lt  lt  endl      Edit     Considering all  proper  naming conventions  as per comments     int N   sizeof name  sizeof name 0      Get the array size  sort name name N     Use the start and end like this  for int i   0  i  lt  N  i         cout  lt  lt  name i   lt  lt  endl      Note  Dietmar K  hl s answer is best in all respect  std  begin    amp  std  end   should be used for std  sort like functions with C  11  else they can be defined

User · Answer

Example using std  vector   include  lt iostream gt   include  lt string gt   include  lt algorithm gt   include  lt vector gt   int main             Initilaize vector using intitializer list   requires C  11       std  vector lt std  string gt  names     john    bobby    dear    test1    catherine    nomi    shinta    martin    abe    may    zeno    zack    angeal    gabby            Sort names using std  sort     std  sort names begin    names end              Print using range-based and const auto amp  for   both requires C  11       for const auto amp  currentName   names                std  cout  lt  lt  currentName  lt  lt  std  endl                   or by using your orignal for loop   vector support    the same way as plain arrays       for int y   0  y  lt  names size    y                 std   cout  lt  lt  names y   lt  lt  std  endl     you were outputting name z   but only increasing y  thereby only outputting element z   14             return 0       http   ideone com Q9Ew2l  This completely avoids using plain arrays  and lets you use the std  sort function  You might need to update you compiler to use the         You can instead add them by using vector push back  name

User · Answer

My solution is slightly different to any of those above and works as I just ran it So for interest    include  lt iostream gt   include  lt string gt   include  lt algorithm gt   include  lt vector gt   using namespace std   int main       char  name       john    bobby    dear    test1    catherine    nomi    shinta    martin    abe    may    zeno    zack    angeal    gabby      vector lt string gt  v name  name   14      sort v begin   v end       for vector lt string gt   const iterator i   v begin    i    v end      i  cout  lt  lt   i  lt  lt         return 0

[c++] C++ String array sorting

Examples related to c++

Examples related to arrays

Examples related to sorting