c++ sorting bubble, heap, quickSort

please read/review before bidding

given 3 groups of numbers :

[login to view URL] sorted (few numbers out of order)

[login to view URL]

3. reversed

each group has 3 sets of 10, 50, 100 numbers

The program i wrote reads the numbers into 9 arrays : random[10] random [50] random[100] reversed[10] reversed[50] reversed[100] etc.

Program performs bubble heap and quickSort on this sets of numbers and prints all of them before and after sorting.

The purpose of the program to analyze efficiency of sorts using this sets of data.

WHAT NEEDS TO BE DONE:

need to count how many comparisons and interchanges EACH of those sorts did for EACH group.

so OUTPUT SHOULD SHOW WHICH SORT USED THE MOST COMPARISONS, WHICH WAS THE

MIDDLE AND WHICH USED THE LEAST(SAME FOR INTERCHANGES)WRITE 3 FUNCTIONS TO CALCULATE VALUES.

EXAMPLE OF OUTPUT:

set of 10 comparisons interchanges

-------------------------------------------------------------------------------------------------------

bubble xxx xxx

heap xxx xxx

quicksort xxx xxx

set of 50

-------------------------------------------------------------------------------------------------------

bubble xxx xxx

heap xxx xxx

quicksort xxx xxx

set of 100

-------------------------------------------------------------------------------------------------------

bubble xxx xxx

heap xxx xxx

quicksort xxx xxx

comparisons min medium max

set of 10 heap=xx quicksort=xx bubble=xx

set of 50 heap=xx quicksort=xx bubble=xx

set of 100 heap=xx quicksort=xx bubble=xx

interchanges min medium max

set of 10 heap=xx quicksort=xx bubble=xx

set of 50 heap=xx quicksort=xx bubble=xx

set of 100 heap=xx quicksort=xx bubble=xx

Programación en C++

Nº del proyecto: #14557425

Sobre el proyecto