Fares A. Bakhit faresbakhit

inheritance
- unless the destructor ~Base is marked virtual, the destructor ~Child won't be called on delete base where base is of type Child*.

set<int> s { 1, 3, 6, 10, 13, 32, 45 };
// first element x such that x >= 13
s.lower_bound(13); // 13
// first element x such that x > 13

s.upper_bound(13); // 32

HU112: Ethics and Professionalism (FCAI-CU Spring 2023-2024)

Dr. Maie Mostafa Gad
FCAI-CU Spring 2023-2024

	// @author Fares A. Bakhit
	// @date 2024-10-03
	// @description Merge and Quick Sort Implementations
	//
	// Compile with at least a C++11 conforming compiler

	#include <cstdlib> // size_t
	#include <functional> // std::less
	#include <utility> // std::swap

	/*
	*
	* Examples:
	*
	* // Calculate GPA using grades from the current page
	* const gpa1 = newecomComputeGPA();
	*
	* // Calculate GPA with modified grades for MA112 and HU118, and removing CS112
	* const gpa2 = newecomComputeGPA({ "MA112": "A+", "HU118": "B+", "CS112": "" });
	*

	from collections.abc import Callable
	import random


	def demand(x: int) -> int:
	d = 0
	if not 0 <= x <= 99:
	raise RuntimeError(f"{x=} not in [0, 100)")
	for m in [19, 59, 79, 89]:
	if x > m:

	# Cannibals & Missioneries solution finder
	# https://archive.org/details/cannibals-missioneries

	import sys
	from enum import IntEnum
	from typing import NamedTuple, Any
	from collections.abc import Iterable, Iterator, Callable


	class Side(IntEnum):

	// File: dynamic.cc
	// Purpose: Demonstrate how a dynamic type system might be implemented
	// Author: Fares A. Bakhit
	// Date: May 8th, 2024
	// License: Zero Clause BSD (https://spdx.org/licenses/0BSD.html)

	#include <cstdint>
	#include <iostream>
	using namespace std;