C++程序设计Y.Daniel Liang 第六章课后习题答案

Exercise6_2

#include using namespace std;

int main() {

// Prompt the user to enter the first number cout << \ int max; cin >> max;

int count = 1;

// Prompt the user to enter the remaining five numbers for (int i = 1; i <= 5; i++) {

cout << \ int temp; cin >> temp;

if (temp > max) { max = temp; count = 1; }

else if (temp == max) count++; }

cout << \

\

\

return 0; }

Exercise6_4

#include using namespace std;

int main() {

double scores[100]; double sum = 0; int count = 0;

do {

cout << \ cin >> scores[count]; sum += scores[count]; }

while (scores[count++] >= 0);

double average = (sum - scores[count]) / (count - 1);

int numOfAbove = 0; int numOfBelow = 0;

for (int i = 0; i < count - 1; i++) if (scores[i] >= average) numOfAbove++; else

numOfBelow++;

cout << \

cout << \ cout << \

return 0; }

Exercise6_6

#include #include using namespace std;

int main() {

const int NUM_OF_PRIMES = 50; // Store prime numbers

int primeNumbers[NUM_OF_PRIMES];

int count = 0; // Count the number of prime numbers int number = 2; // A number to be tested for primeness bool isPrime = true; // Is the current number prime?

cout << \

// Repeatedly find prime numbers while (count < NUM_OF_PRIMES) {

// Assume the number is prime isPrime = true;

// Test if number is prime

for (int i = 0; i < count && primeNumbers[i] <= sqrt(1.0 * number); i++) {

//If true, the number is not prime if (number % primeNumbers[i] == 0) {

// Set isPrime to false, if the number is not prime isPrime = false;

break; // Exit the for loop } }

// Print the prime number and increase the count if (isPrime) {

primeNumbers[count] = number; count++; // Increase the count

if (count % 10 == 0) {

// Print the number and advance to the new line cout << number << endl; } else

cout << number << \ }

// Check if the next number is prime number++; }

return 0; }

Exercise6_8

#include #include using namespace std;

int average(int array[], int size) { int sum = 0;

for (int i = 0; i < size; i++) sum += array[i]; return sum / size; }

double average(double array[], int size) { double sum = 0;

for (int i = 0; i < size; i++) sum += array[i]; return sum / size; }

int main() {

int list1[] = {1, 2, 3, 4, 5, 6};

double list2[] = {5.0, 4.4, 1.9, 2.9, 3.4, 3.5};

cout << average(list1, 6) << endl; cout << average(list2, 6) << endl;

return 0; }

Exercise6_10

#include #include using namespace std;

int minIndex(int list[], int size) {

int min = list[0]; int minIndex = 0;

for (int i = 1; i < size; i++) if (min > list[i]) {

min = list[i]; minIndex = i; }

return minIndex; }

int main()

{

int list[] = {

1, 2, 4, 5, 10, 100, 2, -22 };

cout << \

return 0; }

Exercise6_12

#include using namespace std;

void reverse(int list[], int size) {

for (int i = 0, j = size - 1; i < size / 2; i++, j--) {

int temp = list[i]; list[i] = list[j]; list[j] = temp; } }

int main() {

int myList[] = {

1, 2, 3, 4, 5, 6, 7, 8 };

reverse(myList, 8);

for (int i = 0; i < 8; i++) cout << myList[i] << \

return 0; }

Exercise6_14

#include

#include \#include \#include \