algorithms

16 articles · All tags

• Prime Numbers and the Sieve of Eratosthenes
  A prime has exactly two divisors, 1 and itself. Learn why primes never run out, how the ancient Sieve of Eratosthenes finds them, and why they secure the internet.
• Quicksort
  Quicksort explained: how partitioning around a pivot sorts in place, why average-case performance beats merge sort, and when worst-case behavior strikes.
• P vs NP
  P vs NP explained: why verifying solutions is easy but finding them may be hard, what polynomial time means, and why this Millennium Prize problem matters.
• Dating App Shadowbans: What They Are and How to Actually Test
  The shadowban theory examined: what platforms actually restrict, how to run a real test instead of a panic diagnosis, and the ordinary causes that look like bans.
• How Dating App Algorithms Actually Work
  What is actually known about how Tinder, Hinge, and Bumble rank and match profiles — separating documented mechanics from viral myths about secret scores.
• AI in Hiring: Screeners, Rankers, and Your Application
  Where AI actually sits in modern hiring pipelines — resume rankers, assessments, video scoring — what it measures, and how strong candidates adjust without gaming.
• How ATS Resume Screening Actually Works
  What applicant tracking systems really do to your resume — parsing, knockout questions, ranking — and the formatting and keyword practices that survive them.
• Quantum Computing
  What a quantum computer actually is — qubits, superposition, entanglement, and interference — and which problems it will and will not revolutionize.
• Bellman–Ford Algorithm
  A single-source shortest path algorithm that handles negative edge weights and detects negative cycles, running in O(V×E) time.
• Dynamic Programming
  An optimization technique that solves problems by combining solutions to overlapping subproblems and storing intermediate results to avoid recomputation.
• Merge Sort
  A stable O(n log n) divide-and-conquer sorting algorithm that recursively splits an array and merges sorted halves.
• Breadth-First Search
  A graph traversal algorithm that explores vertices in order of distance from a source using a queue, finding shortest paths in unweighted graphs.
• Hash Tables
  A data structure that stores key–value pairs with expected constant-time insertion, lookup, and deletion.
• Big O Notation
  A notation for describing how an algorithm's runtime or memory usage grows as the input size increases.
• Binary Search
  An algorithm that locates a target in a sorted array in logarithmic time by repeatedly halving the search interval.
• Dijkstra's Shortest Path Algorithm
  A greedy graph algorithm that finds the shortest paths from a single source vertex to all others in graphs with non-negative edge weights.