qsortcode

qsortcode - @param A the array containing the data. @param...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
/** @file qsorttest.h @author CSC 1254 Hacker @date 2005-10-01 Description: Contains prototypes for the quicksort implementation. Course: CS1254.02 Logon ID: cs1254xx Lab #: 3 Instructor: William Duncan */ #ifndef QSORT_H #define QSORT_H using namespace std; /* Your Task: You will need to templatize both of these function prototypes so that they take arrays of any type. For now, they will work with int data. Do not templatize them until you get the program to work with int data. */ /** This function sorts the items in an array into ascending order.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: @param A the array containing the data. @param F the first index of the array. @param L the last index of the array. @return none. */ void QuickSort(int A, int F, int L); /** Prints elements of an array, twenty per line. @param A array containing data to be printed. @param F the first index of the array. @param L the last index of the array. @return none */ void PrintArray(int A,int F,int L); #endif...
View Full Document

Ask a homework question - tutors are online