Simple C++ codes please.

In this program, you will implement the Selection Sort algorithm. Its complexity is O(n) like Bubble and Insertion Sort, but is it faster? You will soon find out! What you need to do: Your program should accept a single command-line parameter, which is the name of the file to read. If the user forgets the command-line parameter, or if the file cannot be found, your program should report an appropriate error message. The first line is the number of records contained in the file. The remaining lines of the file are in the same format as before. Store all the records in an array (or vector). Run the array through the selection sort algorithm, sorting by ID number. You must base your implementation on the pseudocode provided. 1 FOR i = firstIndex to secondToLastIndex: minIndex = i FOR j = i+1 To lastIndex: IF A[J]