Skip to content

This project is aimed at learning about algorithmic complexity with JavaScript, to assess algorithms using Big O notation and considering both time complexity and space complexity.

License

Notifications You must be signed in to change notification settings

danielbatres/algorithmic-complexity-javascript

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Algorithmic complexity with JavaScript and Big O notation

Algorithmic Complexity Evaluation with JavaScript

This project focuses on the evaluation of time and space complexity of algorithms using Big O notation, and employs a concise and simplified evaluation approach.

Evaluation Methods

JavaScript is used to perform the evaluations, making use of the following functions:

  • console.time()
  • console.timeEnd()
  • performance.now()

These functions assist in measuring the execution time of algorithms. It's important to note that the data obtained may not be entirely precise, but they offer a practical way to estimate algorithm performance.

About

This project is aimed at learning about algorithmic complexity with JavaScript, to assess algorithms using Big O notation and considering both time complexity and space complexity.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published