-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Modifications to support animation and GUI scalability to changes in …
…window size.
- Loading branch information
Showing
16 changed files
with
175 additions
and
141 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,17 +1,17 @@ | ||
Title: Static Array (No Gaps) | ||
Title: Static Array | ||
Description: |- | ||
An array is a collection of items stored at contiguous memory locations. | ||
The idea is to store multiple items of the same type together. | ||
This makes it easier to calculate the position of each element by simply adding an offset to a base value, i.e., the memory location of the first element of the array (generally denoted by the name of the array). | ||
Image: assets/media/Array.png | ||
Operations: | ||
Insertion: | ||
Description: Operation which inserts a new element into array. | ||
Description: Operation which inserts a new element into array. A value is inserted using index corresponding to the offset of the array. | ||
Complexity: O(1) | ||
Deletion: | ||
Description: Operation which deletes an element indexed in the array. | ||
Description: Operation which deletes an element indexed in the array. A value is removed at the index corresponding to the offset of the array. | ||
Complexity: O(1) | ||
Search: | ||
Description: Operation which searches the array for a value. | ||
Complexity: O(n) | ||
Description: Operation which searches the array for a value. Typical polynomial searching algorithms include - Bubble Sort and Insertion Sort. | ||
Complexity: O(n^2) | ||
Space Complexity: O(n) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,16 +1,16 @@ | ||
Title: Queue (Circular Array) | ||
Description: |- | ||
Description needs to be written! | ||
etc... | ||
Image: assets/media/Queue.png | ||
A Queue is a linear structure which follows a particular order in which the operations are performed. | ||
The order is First In First Out (FIFO). | ||
A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first. | ||
Operations: | ||
Insertion: | ||
Description: (...). | ||
Complexity: O(x) | ||
Description: Using a head pointer a value is inserted. | ||
Complexity: O(1) | ||
Deletion: | ||
Description: (...). | ||
Complexity: O(x) | ||
Description: Using a tail pointer a value is removed. | ||
Complexity: O(1) | ||
Search: | ||
Description: (...). | ||
Complexity: O(x) | ||
Space Complexity: O(x) | ||
Description: Searching a queue using only queue operations and one queue of space complexity - is essentially performing bubble sort in a circular fashion. | ||
Complexity: O(n^2) | ||
Space Complexity: O(n) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.