Skip to main content

32 docs tagged with "Algorithm"

View All Tags

Algo JS Snippets

Algo JS Snippets. Topics on: Fibonacci Recursive. Read more: Computer Science, Computer Lang, Computer, Program, Algorithm, Algo JS Snippets | Full-Stack Wiki

Algorithm

Algorithm is defined as: Finite sequence of instructions. Topics on: Big O Notation, BFS, DFS, Globbing, Algo JS Snippets, Search Algo, Sort Algo, Heuristic. Re

BFS

BFS is defined as: Search Algo to Traverse breadth first, down Graph child layer by child layer. Topics on: . Read more: Computer Science, Computer Lang, Comput

Big O Notation

Big O Notation is defined as: (equation) to express Order Of Complexity for Algorithm as # inputs vs data points scale. Topics on: Order Of Complexity, O(1), O(

Binary Search

Binary Search is defined as: Algorithm to search element in pre-sorted Array by halving with Logarithmic Complexity. Topics on: BST. Read more: Computer Science

Bitap Algo

Bitap Algo is defined as: Algorithm to Fuzzy Search by transform string to Bitmask & compute # Bitwise Ops for Levenshtein distance. Topics on: Bitmask, Bitwise

BST

BST is defined as: tree data-struct for fast insert/search. Topics on: Treap, Splay Tree. Read more: Computer Science, Computer Lang, Computer, Program, Algorit

Bubble Sort

Bubble Sort is defined as: Sort Algo to iterate elements, compare next & swap index position, to complete sort order. Topics on: Bubble Sort slow impractical -

Cascade

Cascade is defined as: CSS Algorithm to compute value for each property. Topics on: Importance Order, Specificity, Source Order. Read more: CSS, Cascade, Algori

DFS

DFS is defined as: Search Algo to Traverse depth first down Graph entire child subtree & backtrack. Topics on: . Read more: Computer Science, Computer Lang, Com

Diffing

Diffing is defined as: React Heuristic Algorithm to reconcile change in state vs view & handle update to DOM API. Topics on: internal state = VDOM, view = DOM A

Fibonacci Iterative

Fibonacci Iterative is defined as: iterate with start sequence at 1. Topics on: . Read more: Computer Science, Computer Lang, Computer, Program, Algorithm, Algo

Fibonacci Recursive

Fibonacci Recursive is defined as: assume sequence starts with 1. Example of BAD Recursion fn. Traverse down Fibonacci Tree until reach 1. Topics on: Fibonacci

Fuzzy Search

Fuzzy Search is defined as: Typo Tolerance for Search Engine to allow approx match to string via Edit Distance Algorithm. Topics on: Edit Distance, Fuse.js. Rea

Garbage-Collection

Garbage-Collection is defined as: 🧹Algorithm (in JS Engine) to remove old unused Object from Heap Memory. Topics on: Memory Leak, Garbage-Collection is impleme

Globbing

Globbing is defined as: Algorithm to match Wildcard Character pattern ie Glob Pattern || regex. Topics on: Wildcard Character. Read more: Computer Science, Comp

Google Penguin

Google Penguin is defined as: Google Algorithm to fight against paid links, low-quality Anchor Text Optimization, Keyword Stuffing. Topics on: . Read more: Comp

Heap Property

Heap Property. Topics on: . Read more: Computer Science, Computer Lang, Computer, Program, Algorithm, Search Algo, Binary Search, BST, Treap, Heap Property|Wiki

Heuristic

Heuristic is defined as: trial & error approach to solve problems, imperfect, approx, time-efficient solution, experience-based. Topics on: Metaheuristic. Read

Levenshtein distance

Levenshtein distance is defined as: Algorithm to compute Edit Distance by # single char ins/sub/del ops to transform string to another. Topics on: . Read more:

Logarithmic Complexity

Logarithmic Complexity is defined as: Order Of Complexity scales log(n) inputs. Topics on: . Read more: Computer Science, Computer Lang, Computer, Program, Algo

Metaheuristic

Metaheuristic is defined as: framework to solve problems by experimental Heuristic method. Topics on: . Read more: Computer Science, Computer Lang, Computer, Pr

O(1)

O(1) is defined as: constant Order Of Complexity always same for 1 input - not matter how large. Topics on: finding element in array by index. finding value in

O(n2)

O(n2) is defined as: Order Of Complexity to scale exponentially to power of 2. Topics on: . Read more: Computer Science, Computer Lang, Computer, Program, Algor

Order Of Complexity

Order Of Complexity is defined as: of difficulty to scale Algorithm inputs vs time/space. Topics on: Time Complexity, Space Complexity, Logarithmic Complexity.

Search Algo

Search Algo is defined as: Algorithm to find a solution to a problem within a set of possibilities. Topics on: Binary Search, Linear Search. Read more: Computer

Sort Algo

Sort Algo. Topics on: Bubble Sort. Read more: Computer Science, Computer Lang, Computer, Program, Algorithm, Sort Algo|FullStack Wiki by Roger J

Specificity

Specificity is defined as: CSS Weight Algorithm to determine which Style Rule clash to apply; by IICE order. Topics on: IICE. Read more: CSS, Cascade, Specifici

Stack Reconciler

Stack Reconciler is defined as: deprecated Reconciliation Algorithm used for VDOM from React 15.. Topics on: . Read more: React, React Concepts, VDOM, Fiber, Re

Time Complexity

Time Complexity is defined as: Order Of Complexity inputs scales with time to run Algorithm. Topics on: . Read more: Computer Science, Computer Lang, Computer,

Treap

Treap is defined as: BST with Heap Property to ins/del node. Topics on: Heap Property. Read more: Computer Science, Computer Lang, Computer, Program, Algorithm,

Wildcard Character

Wildcard Character is defined as: algebraic placeholder char. Topics on: . Read more: Computer Science, Computer Lang, Computer, Program, Algorithm, Globbing, W