Welcome to Algorithms and Data Structures Tutorial!

Basic algorithms




  • Binary Search
    The fastest way to find an element in a sorted list.


  • Bubble Sort
    How to push bubbles into right places in ϴ(n²) time!
  • Insertion Sort
    Sort in ϴ(n²) time by inserting element to its correct position, like in cards.
  • Selection Sort
    Sort in ϴ(n²) time by putting the next min/max element on the current position.
  • Merge Sort
    Fast, O(n log n) sorting with parallelization potential.
  • Parallel Merge Sort
    Merge Sort running parallel for maximum performance.
  • Quicksort
    Another sorting that on average is O(n log n), but is easier to implement than merge sort.


  • Palindrome detector
    Two simple ways to verify if a String is a palindrome.
  • Caesar cipher
    Find out how to encrypt/decrypt military messages like a cryptographer from the Roman Empire!


Share with the World!