Pinned Loading

1. Big O Quadratic Time Big O Quadratic Time

   1

   // Represents an algorithm whose performance is directly proportional to the squared size of the input data set

   2

   3

   for (const x of Array(n).keys()) {      // O(n)

   4

     for (const y of Array(n).keys()) {    //

   5

       console.log(x, y);                  // O(n)

2. Big O Logarithmic Time Big O Logarithmic Time

   1

   // Represents an algorithm that runs in proportionally to the logarithm of the input size

   2

   3

   const f = (n) => {

   4

     for (let i = 1; i < n.length; i = i * 2) {    // 

   5

       console.log(array[n]);                      // O(log(n))

3. Big O Linear Time Big O Linear Time

   1

   // Represents an algorithm who’s complexity will grow in direct proportion to the size of the input data

   2

   3

   // 1.

   4

   5

   for (const x of Array(n).keys()) {    // n

4. claude-notification-hooks claude-notification-hooks Public

   🔊 Audio and TTS notifications for Claude Code hooks - Get spoken feedback when Claude writes files, runs commands, and more!

   Shell 8