Write a program that allows the user to sort using the Bubble Sort, Selection Sort, Insertion Sort  and Shell Short  The program should be able to read in data from a binary file. The first element of the binary file will be used to tell how many elements to read in.  Once all the data has been read in, the program should sort the data. The user should be able to choose which algorithm to use to sort the data. The program should print the time before and after the sort. The last part of the program should prompt the user for a lower and upper bound. These two value should then be used to decide how much and which part of the array will be display.  You should test all of the sorts on each of the data files.

BinaryFileRead.cpp

// BinaryFileRead.cpp : Defines the entry point for the console application. //

#include "stdafx.h"

#include <iostream>

using namespace std;

int main()

{

int *arrayToSort;

char fileName[50];

int size,readVal;

cout << "Enter a filename to sort => ";

cin >> fileName;

FILE *inFile;

fopen_s(&inFile,fileName, "rb");

fread(&size, sizeof(size), 1, inFile);

arrayToSort = new int[size];

for (int i = 0; i < size; i++) {

fread(&readVal, sizeof(readVal), 1, inFile);

arrayToSort[i] = readVal;

}

fclose(inFile);

return 0;

}

Timing.cpp

// Timing.cpp : Defines the entry point for the console application. //

#include "stdafx.h"

#include <iostream>

#include <time.h> //ctime

#include <sys/timeb.h> //_timeb _ftime_s

using namespace std;

int main()

{

struct _timeb timebuffer;

char timeline[26];

_ftime_s(&timebuffer);

ctime_s(timeline,sizeof(timeline), &(timebuffer.time));

printf("The time is %.19s.%hu %s", timeline, timebuffer.millitm, &timeline[20]);

system("pause");

return 0;

}