necktwi Goto Github PK

followers: 2.0 following: 3.0 repos: 91.0 gists: 1.0

Name: Necktwi

Type: User

Company: FerryFair

Necktwi's Projects

5-heap

Assignment 2 Write a class (or a set of functions, if you are using C) that implements a 5-Heap (i.e., each node has up to 5 children) using an array as discussed in class. Each node of the heap contains two elements: a priority level (integer), and a string value. Implement insert(priority, string_value) that inserts an element in the heap, and delete_max() that removes the value with the highest priority and returns the corresponding string value. (Do not implement delete_min). Since delete_min is not required, optimize the heap structure for delete_max. Write a program that inserts 1,000 random elements in your 5-Heap, and then outputs them from the highest priority value to the lowest using delete_max(). (The heap will be empty at the end of the program.) Output only the result of delete_max(), one element at a time, such as: 681469 "element 1" 529834 "element 2"

acme-tiny

A tiny script to issue and renew TLS certs from Let's Encrypt

adamsneves

apollo

An open autonomous driving platform

arcade-learning-environment

The Arcade Learning Environment (ALE) -- a platform for AI research.

battletank

An open-world head-to-head tank fight with simple AI, terrain, and advanced control system in UE4

bcmrpi3-kernel-bis

Automated weekly build of the default branch 64-bit bcmrpi3_defconfig (+ tweaks) Linux kernel for the RPi3 B / B+

binarysearch

Assignment 1 Write your own implementation of linked lists and one of binary search trees that contain integers. For the purpose of this assignment, you only need to implement "insert" and "find" as follows: If you are writing your code in Java: list.insert(x) list.find(x)