intro to cs, continued
Get flash to fully experience Pearltrees
Valgrind - Wikipedia, the free encyclopedia
Valgrind ( / ˈ v æ l ɡ r ɪ n d / ) is a GPL licensed programming tool for memory debugging , memory leak detection, and profiling . It is named after the main entrance to Valhalla in Norse mythology . [ 1 ]
Linked list - Wikipedia, the free encyclopedia
In computer science , a linked list is a data structure consisting of a group of nodes which together represent a sequence.
Bitwise operation - Wikipedia, the free encyclopedia
A bitwise operation operates on one or more bit patterns or binary numerals at the level of their individual bits . It is a fast, primitive action directly supported by the processor , and is used to manipulate values for comparisons and calculations.
To determine the depth of a node, count the number of pointers it takes to travel from the root to the current node; that number is called the depth of the node.
Basic Programming: Trees
Binary search tree - Wikipedia, the free encyclopedia
A binary search tree of size 9 and depth 3, with root 8 and leaves 1, 4, 7 and 13 In computer science , a binary search tree ( BST ), which may sometimes also be called an ordered or sorted binary tree , is a node-based binary tree data structure which has the following properties: [ 1 ]Heapsort is a comparison-based sorting algorithm to create a sorted array (or list), and is part of the selection sort family.
Heapsort - Wikipedia, the free encyclopedia
Huffman tree generated from the exact frequencies of the text "this is an example of a huffman tree".
Huffman coding - Wikipedia, the free encyclopedia
Angry C is angry.
Angry C Is Angry « Worldgnat
having brain segfault beginning at the point this course first began down the C path. :p by Feb 13
A segmentation fault (often shortened to segfault ), bus error or access violation is generally an attempt to access memory that the CPU cannot physically address.
Segmentation fault - Wikipedia, the free encyclopedia
Huffman Encoding Compression Algorithm Tutorial - Cprogramming.com
The Huffman encoding algorithm is an optimal compression algorithm when only the frequency of individual letters are used to compress the data. (There are better algorithms that can use more structure of the file than just letter frequencies.)16.extension.harvard.edu
helpful. will want to come back to this one. by Feb 15
cs, cont.
why is that necessary? also, it wasn't even done in a way that made sense according to the content. it was merely visual. by 5footshelflife Feb 19
this tree has been re-organized against my will. sure, it looks better, but... by 5footshelflife Feb 18