Skip to content
Theory of Coding

Theory of Coding

Search
  • Home
  • Data Structures
    • Graphs
      • Graph Theory Basics
      • Breadth First Search Algorithm
      • Snakes and Ladders Game Code
      • Depth First Search Algorithm
      • Bellman Ford Algorithm
      • Prim’s Algorithm
      • Dijkstra’s Algorithm
    • Trees
      • Binary Indexed Tree (or) Fenwick Tree
      • Trie Tree
      • Compressed Trie Tree
      • N-ary tree or K-way tree data structure
      • Segment Trees
      • Binary Heaps
      • Binary Heaps and Heapsort Algorithm
  • Algorithms
    • Searching & Sorting
      • Binary Search
      • Jump Search
      • Quick Sort
      • Merge Sort
    • Dynamic Programming
      • Introduction and Fibonacci Numbers
      • Kadane’s Algorithm
      • Edit Distance
    • Math
      • Modular Arithmetic Properties
  • AI
    • MiniMax Algorithm
    • Minimax algorithm with Alpha-Beta Pruning
    • Iterative Deepening Depth First Search
    • Bidirectional Search
  • Java
    • Language Basics
      • An Introduction
      • Data Types, Input and Operators
      • If Else, Switch and Loops
      • Strings, StringBuffer and StringBuilder
      • Arrays in Java
      • Enum and Methods in Java
    • Introduction to OOP
      • Java Tutorials – Classes and Objects
      • Encapsulation in Java
      • Constructor and Overloading Methods
      • Inheritance
Theory of Coding

Theory of Coding

Close menu
  • Home
  • Data Structures
    • Graphs
      • Graph Theory Basics
      • Breadth First Search Algorithm
      • Snakes and Ladders Game Code
      • Depth First Search Algorithm
      • Bellman Ford Algorithm
      • Prim’s Algorithm
      • Dijkstra’s Algorithm
    • Trees
      • Binary Indexed Tree (or) Fenwick Tree
      • Trie Tree
      • Compressed Trie Tree
      • N-ary tree or K-way tree data structure
      • Segment Trees
      • Binary Heaps
      • Binary Heaps and Heapsort Algorithm
  • Algorithms
    • Searching & Sorting
      • Binary Search
      • Jump Search
      • Quick Sort
      • Merge Sort
    • Dynamic Programming
      • Introduction and Fibonacci Numbers
      • Kadane’s Algorithm
      • Edit Distance
    • Math
      • Modular Arithmetic Properties
  • AI
    • MiniMax Algorithm
    • Minimax algorithm with Alpha-Beta Pruning
    • Iterative Deepening Depth First Search
    • Bidirectional Search
  • Java
    • Language Basics
      • An Introduction
      • Data Types, Input and Operators
      • If Else, Switch and Loops
      • Strings, StringBuffer and StringBuilder
      • Arrays in Java
      • Enum and Methods in Java
    • Introduction to OOP
      • Java Tutorials – Classes and Objects
      • Encapsulation in Java
      • Constructor and Overloading Methods
      • Inheritance
Theory of Coding

Theory of Coding

Search Toggle menu

Tag: Search Algorithms

21 January 2018Artificial Intelligence

Bidirectional Search

Hello people! In this post we will talk about Bidirectional Search, a powerful search strategy which can be used if you have […]

14 January 2018Artificial Intelligence

Iterative Deepening Depth First Search (IDDFS)

Hello people! In this post we will talk about another search algorithm Iterative deepening depth first search (IDDFS) or Iterative deepening search […]

10 November 201619 November 2023Searching Algorithms

Jump Search Algorithm

Hello, people…! In this post, we will discuss a new search algorithm, Jump Search, which searches for an element in a sorted […]

Recent Posts

  • Bidirectional Search
  • Iterative Deepening Depth First Search (IDDFS)
  • N-ary tree or K-way tree data structure
  • Rotate matrix clockwise
  • Print matrix in spiral order

Categories

  • Array Interview Questions
  • Artificial Intelligence
  • C++ Tutorials
  • Competitive Coding
  • Dynamic Programming
  • Graph Theory
  • Heaps
  • Java
  • Math
  • Searching Algorithms
  • Sorting Algorithms
  • Tree Data Structures
© 2025 Theory of Coding. Proudly powered by Sydney