Question

Algorithm 1: built-in sort

The first algorithm you must implement is in builtin_sort, which must use the std::sort or qsort functions built into C++ to sort a vector of words. The function should sort the vector in-place, so it takes the vector as a non-const reference and returns void. This function may only need to be one line long.

Both std::sort and qsort have time complexity O(n n). In addition, since these are widely-used library functions, developers have put a lot of work into making them fast in terms of constant factors. Therefore we should expect this algorithm to have better constant factors than algorithms 3 and 4.

implement it here:

void builtin_sort(string_vector& unsorted) {
// TODO: implement this function, then delete this comment
}

Answer 1

We are working in C++ so better use std:sort for sorting

void builtin_sort( string_vector &unsorted)

{

std::sort(unsorted.begin(), unsorted.end());

}

here is the example which shows how it works you can run it on your environment

#include<bits/stdc++.h>
using namespace std;
typedef std::vector<string> string_vector; // this is type define n
void builtin_sort(string_vector & unsorted)
{
   std::sort(unsorted.begin(),unsorted.end()); // this is the function sort which will sort
}
int main()
{

   string_vector unsorted;
   unsorted.push_back("ankit");
   unsorted.push_back("sharma");
   unsorted.push_back("sushil");
   unsorted.push_back("suinta");
   unsorted.push_back("arpit");
   builtin_sort(unsorted);
   string_vector:: iterator it;
   cout<<"vector before sorting is:";
  
   for(it=unsorted.begin();it!=unsorted.end();it++) //unsorted data will be printed here
       cout<<"\n"<<*it;
   cout<<"\n\nvector after sorting is:";
  

   for(it=unsorted.begin();it!=unsorted.end();it++) //sorted data will be printed here
       cout<<"\n"<<*it;
}

output is: