Firehoze - Browse Lessons by Computer Science

Big Oh Notation (College Level)
Instructor: Robert Chase (Rpchase)
Computer scientists count how many operations their algorithms take to run. A notation has been developed to simplify these counts. Sorting algorithms have different complexities. Bubble sort has a high level of complexity while radix sort has a low level of complexity.

Linked Lists - Part 2: Implementation in Java (College Level)
Instructor: Aheaney
This tutorial provides a demonstration of how to implement and operate on a singly linked list in Java using an imperative style. (Note: No part of the Java Collections Framework is used in this tutorial)

Linked Lists - Part 1: Overview (College Level)
Instructor: Aheaney
This tutorial provides a non-language specific overview of how linked lists function and are composed in the abstract. Linked Lists - Part 2 will demonstrate how to actually implement a linked list in Java.

Recursion I - Iterative with Numbers (College Level)
Instructor: Aheaney
This tutorial provides a mathematical, non-language specific introduction to how iterative recursion works.

Stacks and Queues - Part 2 - Implementation (College Level)
Instructor: Aheaney
This tutorial provides a demonstration of an implementation of a simple stack and queue using a linked list structure in Java. (Note: No part of the Java Collections Framework is used in this demonstration)

Stacks and Queues - Part 1 - Review (College Level)
Instructor: Aheaney
This tutorial provides an overview of stack and queue data structures in the abstract. Part 2 provides a demo of an actual implementation of a stack and queue structure in Java.