-
Recent Posts
Recent Comments
- Alan Briggs on My Review of “The Golden Ticket: P, NP, and the Search for the Impossible”
- Quantum Mechanic on Approximating the Set Cover Problem
- Derek Bowen on The PageRank Algorithm
- Approximating the Set Cover Problem | LEARNINGlover.com on What is a “Hard” Problem?
- What is a “Hard” Problem? | LEARNINGlover.com on Knapsack Problems
Archives
Categories
Meta
Tag Archives: binary
Learn About “the Other” Algebra
When I visit family for the holidays, the topic of my being a mathematician always seems to come up, and there’s always a child in the family struggling with maths, and when I ask the subject of their struggles the … Continue reading
Posted in Blog, Examples
Tagged abstract algebra, associative, binary, binary operatot, calculator, closed, cyclic, group, group theory, groups, identity, inverse, JavaScript, math, mathematics, maths, modern algebra, operator, order, script, set, set theory
2 Comments
Visualizing Huffman Coding Trees
Here is a link to a script I finished to help visualize the Huffman Coding Algorithm. What would you do if you wanted to transfer a message, say one written in English but you only had a limited set of … Continue reading
Posted in Blog, Examples
Tagged algorithm, ascii, binary, binary tree, coding, encoding, encryption, entropy, grouping, huffman, huffman coding, join, probability, tree
Leave a comment
Learn About Binary Search Trees
I just finished a script that shows the properties of the binary search tree data structure. These data structures are organized such that the data lies in “nodes” and each node connects directly to up to two new nodes. These … Continue reading
Posted in Blog, Examples
Tagged binary, binary search tree, child, data, data structure, delete, inorder, insert, javascrtipt. node, left child, log n, n log n. algorithms, parent, postorder, preorder, recursion, remove, right child, script, search, sort, sorted, structure, tree
1 Comment
Examples of the Binary Search Algorithm
I have published code that shows examples of the Binary Search Algorithm. In order for this algorithm to be applicable, we need to assume that we’re dealing with a sorted list to start. As a result, instead of proceeding iteratively … Continue reading
Posted in Blog, Examples
Tagged algorithm, binary, binary search, conquer, divide, divide and conquer, iteration, list, search
Leave a comment