diff options
Diffstat (limited to 'src/01/01b/README.md')
| -rw-r--r-- | src/01/01b/README.md | 7 |
1 files changed, 3 insertions, 4 deletions
diff --git a/src/01/01b/README.md b/src/01/01b/README.md index f288e0f..ceab17a 100644 --- a/src/01/01b/README.md +++ b/src/01/01b/README.md @@ -1,14 +1,13 @@ -# Learning Profile for Assignment #1 - Question #6 - Computer Science 272: Data Structures and Algorithms +# Learning Profile for Assignment #1 - Question #1b - Computer Science 272: Data Structures and Algorithms Name: Mo Khan Student ID: 3431709 1. Problem Statement: -Design and implement a MinStack data structure that can store comparable elements and supports the stack operations `push(x)`, `pop()`, and `size()`, -as well as the `min()` operation, which returns the minimum value currently stored in the data structure. +Implement the stack methods `push(x)` and `pop()` using two queues. -All operations should run in constant time. +Analyze the running time of the push(x) and pop() operations based on this implementation. 2. Description of the Code: 3. Errors and Warnings: |