https://github.com/espiramarvin/dsa-practices

DSA Practices
https://github.com/espiramarvin/dsa-practices

algorithms data-structures

Last synced: about 1 month ago
JSON representation

DSA Practices

• Host: GitHub
• URL: https://github.com/espiramarvin/dsa-practices
• Owner: EspiraMarvin
• Created: 2022-06-01T05:53:10.000Z (over 2 years ago)
• Default Branch: main
• Last Pushed: 2023-11-28T07:02:01.000Z (about 1 year ago)
• Last Synced: 2023-11-28T20:22:03.358Z (about 1 year ago)
• Topics: algorithms, data-structures
• Language: JavaScript
• Homepage:
• Size: 2 MB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
#### DS & A

### BIG-O TIME COMPLEXITY 

#### 1. Linear time complexity      - O(n) worst case time complexity/time complexity

#### 2. Constant time complexity    - O(1)

#### 3. Quadratic time complexity   - O(n^2)

#### 4. Cubic time complexity       - O(n^3)

#### 5. Logarithmic time complexity - O(logn) - input size reduced by half - O(logn)




##### BIG-O GUIDE

###### 1. loop - O(n)

###### 2. nested loop -O(n^2)

###### 3. Logarithmic O(log n) input size reduced by half




### BIG-O SPACE COMPLEXITY

#### 1. Constant - O(1) -no extra space/memory needed when input size increases

#### 2. Linear   - O(n) - extra space neede when input size increases

#### 3. Logarithmic -O(log n) - extra space needed grows but not at the same rate as the input size

#### 4. Quadratic - you should try to avoid