https://github.com/devenock/Javascript-DSA

Solving DSA Challenges using Javascript.
https://github.com/devenock/Javascript-DSA

algorithms-and-data-structures javascript

Last synced: 4 months ago
JSON representation

Solving DSA Challenges using Javascript.

• Host: GitHub
• URL: https://github.com/devenock/Javascript-DSA
• Owner: devenock
• Created: 2022-09-22T18:58:53.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2024-06-19T03:54:24.000Z (over 1 year ago)
• Last Synced: 2025-04-28T16:57:13.825Z (7 months ago)
• Topics: algorithms-and-data-structures, javascript
• Language: JavaScript
• Homepage:
• Size: 39.1 KB
• Stars: 3
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Big O notation can be generally classified as:

## O(1):

Run time is independent of the input size of the problem.

## O(n):

The problem requires a small amount of processing time for each element in the input. Linear.

## O(n²):

The problem process all the pairs of the element. Quadratic.

## O(log n):

When a big problem is solved by transforming it into a smaller size by some constant fraction. Logarithmic.

## O(n log n):

When a problem is broken into smaller subproblems, solving them independently, and combining the solutions. Linearithmic.

## O(2^n):

Exponential run time. To be avoided.