Skip to content
View NikoEscobar's full-sized avatar
🐺
<Lobo /> Game Dev
🐺
<Lobo /> Game Dev
  • @CrystalGameStd;
  • Brazil - SP

Block or report NikoEscobar

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
NikoEscobar/README.md

roadmap.sh

Pinned Loading

  1. A collection of sorting algorithms i... A collection of sorting algorithms implemented in TypeScript for studying
    1
    // - - Sorting Algorithms
    2
    // - Bubble Sort - O(n^2) - Quadratic Time
    3
    // - Merge Sort - O(n log n) - Quasilinear Time
    4
    // - Quick Sort - O(n log n) - Quasilinear Time
    5
    // - Heap Sort - O(n log n) - Quasilinear Time
  2. A collection of backtracking algorit... A collection of backtracking algorithms implemented in TypeScript for studying
    1
    //=========================- - Backtracking Algorithms - -=========================//
    2
    
                  
    3
    /*
    4
    - Backtracking algorithms:
    5
      are a type of algorithmic technique that is used to solve problems by trying out different
  3. A collection of dynamic programming ... A collection of dynamic programming algorithms implemented in TypeScript for studying
    1
    //=========================- - Dynamic Programming Algorithms - -=========================//
    2
    
                  
    3
    /*
    4
    - Dynamic Programming:
    5
      is a problem-solving technique that involves breaking down a complex problem into smaller, simpler
  4. A collection of graph search algorit... A collection of graph search algorithms implemented in TypeScript for studying
    1
    //=========================- - Search Algorithms - -=========================//
    2
    
                  
    3
    //- Binary Search
    4
    
                  
    5
    //Binary Search assumes that the input array is already sorted in ascending order.