C / C++ / MFC

1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10

//written with Qt
#include <QtCore/QCoreApplication>
#include <iostream>
#include <time.h>
#include <iomanip>
#include <string>
#include <fstream>
#include <vector>

using namespace std;

//sorting function
void insertion_sort(int *wsk, unsigned long size);

int main(int argc, char *argv[])
{
    QCoreApplication a(argc, argv);

    //vector to hold data from file
    vector <int> array_vector;

    //stream to file
    ifstream plik ("numbers.txt",ios::in);

    //single number that is being readed from file    
    unsigned long single_number;

    
    while(plik >> single_number)
    {
        array_vector.push_back(single_number);
    }

    int array_nonsorted[array_vector.size()];
    //copying from vector to array
    for (unsigned long a = 0; a < array_vector.size(); a++)
    {
        array_nonsorted[a] = array_vector[a];
    }

    time_t start,end; double long dif;

    cout << "START\n";
    time(&start);
    insertion_sort(array_nonsorted,array_vector.size());
    time(&end);
    cout << "STOP\n";
    dif = difftime(end,start);
    cout << "Array sorted in " << setprecision(5) << dif << "sec"; dif = dif/60; cout << " = " << dif << "minutes";
    //cout << "End.";
    return a.exec();
}
void insertion_sort(int *wsk, unsigned long size)
{
    int tab_sorted[size];

    //In final version I will do this by using pointers. I'm just copying it because with using pointers it's hard to see data in debugger
    for(unsigned long i = 0; i < size; i++)
    {
        tab_sorted[i] = wsk[i];
    }

    //main sort engine

    for (unsigned long a = 1; a < size; a++)
    {
        if (a == 1)
        {
            if (tab_sorted[0] > tab_sorted[1])
            {
                unsigned long temp = tab_sorted[0];
                tab_sorted[0] = tab_sorted[1];
                tab_sorted[1] = temp;
            }
        }
        else
        {
            for (unsigned long b = 0; b <= a-1; b++)
            {
                if (tab_sorted[a] < tab_sorted[b])
                {
                   unsigned long temp = tab_sorted[a];
                   for (unsigned long c = a; c > b; c--)
                   {
                       tab_sorted[c] = tab_sorted[c-1];
                   }
                   tab_sorted[b] = temp;
                }
            }
        }

    }
}