Question pool¶
Hello pointer¶
Solution to Exercise 3
int b = 42, *a = &b;
printf("%d\n", *a);
*a = 17;
printf("%d\n", b);42
17Pointærray¶
Solution to Exercise 4
pointærray.c
#include <stdio.h>
constexpr size_t SIZE = 11;
int main() {
int nums[SIZE] = {-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5};
//// BEGIN SOLUTION
int *ptr;
ptr = nums;
for (size_t i = 0; i < SIZE; ++i)
printf("%d ", ptr[i]); // same as ptr + i
puts("");
constexpr size_t MIDDLE = SIZE / 2;
ptr = &nums[MIDDLE];
for (size_t i = 0; i < MIDDLE + 1; ++i)
printf("%d ", ptr[i]);
puts("");
//// END SOLUTION
}Arrays as arguments¶
Solution to Exercise 5
arrays_as_arguments.c
#include <stdcountof.h>
#include <stdio.h>
int sum(const int *const a, const size_t size) {
int sum = 0;
for (size_t i = 0; i < size; ++i)
sum += a[i];
return sum;
}
void vector_sum(const int *const a, const int *const b, int *const sum,
const size_t size) {
for (size_t i = 0; i < size; ++i)
sum[i] = a[i] + b[i];
}
int main() {
int a[] = {1, 2, 3};
printf("sum of a: %d\n", sum(a, countof(a)));
int b[] = {-1, -2, -3};
int sum[countof(a)];
vector_sum(a, b, sum, countof(a));
printf("vector_sum of a, b: ");
for (size_t i = 0; i < countof(a); ++i)
printf("%d ", sum[i]);
puts("");
}arrays_as_arguments.transcript.txt
sum of a: 6
vector_sum of a, b: 0 0 0
Card game¶
Solution to Exercise 1
card_game.c
#include <stdcountof.h>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
const char *suits[] = {"Clubs", "Hearts", "Spades", "Diamonds"},
*faces[] = {"Ace", "Deuce", "Three", "Four", "Five",
"Six", "Seven", "Eight", "Nine", "Ten",
"Jack", "Queen", "King"};
constexpr size_t ROW_COUNT = countof(suits), COLUMN_COUNT = countof(faces);
constexpr int CARD_COUNT = ROW_COUNT * COLUMN_COUNT, DEAL_PRINT_ROW_COUNT = 4;
// A deck is an array of countof(suits) * countof(faces) elements. Each element
// show the order of the card beginning at 1.
typedef int Deck[ROW_COUNT][COLUMN_COUNT];
//// BEGIN SOLUTION
constexpr size_t HAND_CARD_COUNT = 5;
typedef size_t Hand[HAND_CARD_COUNT];
// TODO next time, provide emojis option
// const char *suits[] = {"♣️", "♥️", "♠️", "♦️"},
// *faces[] = {"🅰️", "2️⃣", "3️⃣", "4️⃣", "5️⃣", "6️⃣", "7️⃣",
// "8️⃣", "9️⃣", "🔟", "🤴", "👸", "👑"};
//// END SOLUTION
void shuffle(Deck deck) {
for (int card = 1; card <= CARD_COUNT; ++card) {
size_t column, row;
do {
column = rand() % COLUMN_COUNT;
row = rand() % ROW_COUNT;
} while (deck[row][column]);
// Choose a random element until an empty element (0) is found
deck[row][column] = card;
}
}
void print_deck(const Deck deck) {
puts("Deck:");
for (size_t row = 0; row < ROW_COUNT; ++row) {
for (size_t column = 0; column < COLUMN_COUNT; ++column) {
printf("%2d ", deck[row][column]);
}
puts("");
}
}
void print_card(size_t row, size_t column) {
printf("%5s of %-8s ", faces[column], suits[row]);
}
void deal_all(Deck deck) {
puts("52 dealt cards:");
for (int card = 1; card <= CARD_COUNT; ++card) {
for (size_t row = 0; row < ROW_COUNT; ++row)
for (size_t column = 0; column < COLUMN_COUNT; ++column)
if (deck[row][column] == card) {
print_card(row, column);
if (card % DEAL_PRINT_ROW_COUNT == 0)
puts("");
}
}
}
void scan_deck(Deck deck) {
puts("Waiting for the deck:");
for (size_t row = 0; row < ROW_COUNT; ++row)
for (size_t column = 0; column < COLUMN_COUNT; ++column)
scanf("%2d", &deck[row][column]);
}
//// BEGIN SOLUTION
void deal(Deck deck, int count, Hand hand_suits, Hand hand_faces) {
printf("A hand of %zu cards:\n", HAND_CARD_COUNT);
for (int card = 1; card <= count; ++card) {
for (size_t row = 0; row < ROW_COUNT; ++row)
for (size_t column = 0; column < COLUMN_COUNT; ++column)
if (deck[row][column] == card) {
print_card(row, column);
if (card % DEAL_PRINT_ROW_COUNT == 0)
puts("");
deck[row][column] = 0;
hand_suits[card - 1] = row;
hand_faces[card - 1] = column;
}
}
puts("");
}
bool has_a_pair(Hand hand_suits, Hand hand_faces, size_t card_count) {
printf("Contains a pair: ");
// Check for the same face
for (size_t card1 = 0; card1 < card_count; ++card1)
for (size_t card2 = card1 + 1; card2 < card_count; ++card2)
if (hand_faces[card1] == hand_faces[card2]) {
puts("Yes");
print_card(hand_suits[card1], hand_faces[card1]);
puts("");
print_card(hand_suits[card2], hand_faces[card2]);
puts("");
return true;
}
puts("No");
return false;
}
bool has_two_pairs(Hand hand_suits, Hand hand_faces, size_t card_count) {
bool found_a_pair = false;
size_t paired_cards[2];
printf("Contains two pairs: ");
// Check for the same face
for (size_t card1 = 0; card1 < card_count; ++card1)
for (size_t card2 = card1 + 1; card2 < card_count; ++card2)
if (hand_faces[card1] == hand_faces[card2]) {
if (!found_a_pair) {
paired_cards[0] = card1;
paired_cards[1] = card2;
found_a_pair = true;
} else {
if (paired_cards[0] != card1 && paired_cards[1] != card1 &&
paired_cards[1] != card2 && paired_cards[1] != card2) {
puts("Yes");
puts("Pair 1:");
print_card(hand_suits[paired_cards[0]],
hand_faces[paired_cards[0]]);
puts("");
print_card(hand_suits[paired_cards[1]],
hand_faces[paired_cards[1]]);
puts("");
puts("Pair 2:");
print_card(hand_suits[card1], hand_faces[card1]);
puts("");
print_card(hand_suits[card2], hand_faces[card2]);
puts("");
return true;
}
}
}
puts("No");
return false;
}
//// END SOLUTION
int main() {
Deck deck = {};
// Uncomment the following to create a random deck
// srand(time(nullptr));
// shuffle(deck);
// print_deck(deck);
// puts("");
// deal_all(deck);
// puts("");
scan_deck(deck);
puts("");
print_deck(deck);
puts("");
//// BEGIN SOLUTION
Hand hand_suits, hand_faces;
deal(deck, countof(hand_suits), hand_suits, hand_faces);
puts("");
has_a_pair(hand_suits, hand_faces, HAND_CARD_COUNT);
puts("");
has_two_pairs(hand_suits, hand_faces, HAND_CARD_COUNT);
//// END SOLUTION
}Bubble sort¶
Solution to Exercise 2
bubble_sort.c
#include <stdcountof.h>
#include <stddef.h>
#include <stdio.h>
int TEST_ARR[] = {5, 3, -2, 4, 4, 9};
void swap(int *a, int *b) {
//// BEGIN SOLUTION
auto tmp = *a;
*a = *b;
*b = tmp;
//// END SOLUTION
}
void bubble_sort(int *arr, size_t size, bool (*is_in_order)(int a, int b)) {
//// BEGIN SOLUTION
bool swapping_occurred;
do {
swapping_occurred = false;
for (size_t i = 1; i < size; ++i)
if (!is_in_order(arr[i - 1], arr[i])) {
swap(&arr[i - 1], &arr[i]);
swapping_occurred = true;
}
} while (swapping_occurred);
//// END SOLUTION
}
//// BEGIN SOLUTION
bool is_in_ascending_order(int a, int b) { return b >= a; }
bool is_in_descending_order(int a, int b) { return a >= b; }
//// END SOLUTION
void print_arr(int *arr, size_t size) {
for (size_t i = 0; i < size; ++i)
printf("%d ", arr[i]);
puts("");
}
int main() {
puts("Input:");
print_arr(TEST_ARR, countof(TEST_ARR));
puts("");
puts("Ascending:");
bubble_sort(TEST_ARR, countof(TEST_ARR), is_in_ascending_order);
print_arr(TEST_ARR, countof(TEST_ARR));
puts("");
puts("Descending:");
bubble_sort(TEST_ARR, countof(TEST_ARR), is_in_descending_order);
print_arr(TEST_ARR, countof(TEST_ARR));
}