Joel & Mr. Fisher

Bucket Sort (1.27.22)

Source code

Results (average of timing three tests)

Sort Method	All	Worst	Best	Random
Bubble Sort	4.8s	5s	0.4s	0.4s
Selection Sort	5.1s	2.1s	2.1s	2.5s
Insertion Sort	4s	1.5s	0.3s	1.9s
Bucket Sort	.7s

Functional Programming in Haskell (5.20.22)

romanNumerals.hs - convert integers to roman numeral strings

booleans.hs - functional implementation of booleans

Hash Table Python Implementation (4.23.22)

HashTable Documentation

Getting Started

from HashTable import HashTable
ht=HashTable()

Methods

get, set, clear, remove, size, is_empty, has, keys, values, inspect

get(key) -> value

Returns the HashMap's value of the key

set(key, value) -> None

Sets the HashMap to your value at the key

clear() -> None

Removes all the key-value pairs, emptying the HashMap.

remove(key) -> value

Removes the key-value pairs at the specified key. Returns the removed value.

size() -> int

Returns the number of key-value pairs.

is_empty() -> bool

Returns whether or not the HashMap has no key-value pairs.

has(key) -> bool

Returns whether or not the HashMap has a key-value pair of the specified key.

keys() -> array[any]

Returns all the keys of the HashMap in an array.

values() -> array[any]

Returns all the values of the HashMap in an array.

inspect() -> str

Returns the raw self.data for development purposes

Example

                
>>> ht=HashTable()
>>> ht.set('hi', 'world')
>>> ht.get('hi')
'world'
>>> ht.set('authors', ['joel', 'david'])
>>> print(ht)
HashTable {
    authors: ['joel', 'david'],
    hi: world
}
>>> ht.has('hi')
True
>>> ht.size()
2
>>> ht.keys()
['authors', 'hi']
>>> ht.values()
[['joel', 'david'], 'world']
>>> ht.remove('authors')
['joel', 'david']
>>> print(ht)
HashTable {
    hi: world
}
>>> ht.clear()
>>> print(ht)
{}

Record of Joel & Mr. Fisher

9th Grade

10th Grade

Bucket Sort (1.27.22)

11th Grade

AI Final Project