×
Home Discussions Write at Opengenus IQ
×
  • Join our Internship πŸŽ“
  • #7daysOfCode
  • C Interview questions
  • Linux πŸ’½
  • πŸ”Š Data Structures
  • Graph Algorithms
  • Dynamic Programming πŸ’‘
  • Greedy Algo πŸ“”
  • Algo Book 🧠
  • String Algo 🧬
  • Home

Search Algorithms

Searching is an under-rated operation as the ability to search a data in an ever growing data set requires unique algorithmic approaches

Software Engineering

Implementing Binary search in C++

We have explained in depth how to implement Binary Search in C++. We have covered 3 approaches: Recursive implementation, Iterative implementation and using STL functions.

Anuj Jhamb
Algorithms

Try these questions if you think you know Linear Search

Must attempt questions on Linear Search algorithm. Linear Search seem to be a simple algorithm but understanding it deeply requires expertise. It is a guarantee that you will learn new things about this on going through our questions.

OpenGenus Foundation OpenGenus Foundation
red black tree

Red Black Tree: Search

We will explore the search operation on a Red Black tree in the session. Searching in Red Black tree takes O(log N) time complexity and O(N) space complexity. A red–black tree is a kind of self-balancing binary search tree in computer science.

Vipul Gupta Vipul Gupta
Graph Algorithms

Depth First Search

Depth-first search (DFS) algorithm is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.

Alexa Ryder Alexa Ryder
Search Algorithms

Exponential Search Algorithm

Algorithm Complexity Implementations Applications Discussions Exponential search algorithm (also called doubling search, galloping search, Struzik search) is a search algorithm, created by Jon Bentley and Andrew Chi-Chih Yao in 1976, for searching sorted,

Alexa Ryder Alexa Ryder
Search Algorithms

Ternary Search Algorithm

Algorithm Complexity Implementations Applications Discussions Ternary search is a divide-and-conquer search algorithm. It is mandatory for the array (in which you will search for an element) to be sorted before we begin the

Alexa Ryder Alexa Ryder
Search Algorithms

Jump Search Algorithm

Algorithm Complexity Implementations Applications Discussions Jump Search is a searching algorithm for sorted arrays. The basic idea is to check fewer elements by jumping ahead by fixed steps or skipping some elements in

Alexa Ryder Alexa Ryder
Search Algorithms

Interpolation Search Algorithm

Algorithm Complexity Implementations Optimizations Applications Discussions You stored 2GB of data in your computer and you successfully executed a search in a blink of an eye. Great! You may have used binary search

Alexa Ryder Alexa Ryder
Search Algorithms

Binary Search Algorithm

Binary Search algorithm is an efficient comparison based search algorithm where the key idea is to reduce size of search space by half in every iteration by exploiting a restriction on the search space that it is in sorted order. When suitable, binary search is choose over other search algorithms

Alexa Ryder Alexa Ryder
Search Algorithms

Linear Search algorithm

Linear search is a search algorithm inspired by real-life events. Implementations are available in C, C++, Java, C#, Clojure, Go, Haskell, JavaScript, Kotlin, PHP, Ruby, Rust, Scala, Swift, Meta and Nim.

Alexa Ryder Alexa Ryder
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2021 All rights reserved β„’ [email: team@opengenus.org]
Top Posts LinkedIn Twitter