Basic Computer Science

Stacks are a type of list in which all inserts and removals happen at one end. Imagine a normal stack of cafeteria trays: to get one, you take it off…

All right, so you've read about sorting algorithms, and now you've got a sorted array. Just having a sorted array, however, doesn't do anything for you unless you are going…

It is recommended that you read the essay on linked lists before proceeding to this essay. Trees are data structures organized into a group of interconnected nodes that form leaves…

Sorting has been analyzed by computer scientists for decades, and thus it is an ideal subject to begin with when studying computer science. Sorting is done with algorithms, which are…

Lists and Array are the most basic types of data structures. They allow the programmer to organize data into more sophisticated patterns than the simple variables would allow. Almost all…

Recursion and iteration are two very commonly used, powerful methods of solving complex problems, directly harnessing the power of the computer to calculate things very quickly. Both methods rely on…

Algorithms like Quicksort and Mergesort are exceedingly fast, but require lots of space to do the operations. On the other side of the spectrum, Bubble Sort is exceedingly slow, but…

It turns out that when you wish to convert from decimal to octal or hexadecimal, there is a very easy formula that you can use. I'll give you the one…

This essay is targeted at new students of computer programming or computer science who want to understand how base two (binary), base eight (octal), and base sixteen (hexadecimal) work. First…

If you're an aspiring computer science student or someone who wants to switch fields into CS, you're in luck; there's a lot of information available on the Internet. CS is…