A quick overview of the most efficient way to find an integer in a sorted rotated array.
Also find me here:
Baeldung Author
Said Sryheni
I am a backend JEE developer specialized in technologies like Spring and Hibernate with +3 years of experience. I have been an ICPC competitive programmer using C++ for +5 years. You can check my ICPCID on https://icpc.baylor.edu/ICPCID/VHOFJ5IO88M4
Here's what I've written (so far):
Finding the Only Unpaired Element in the Array
Filed under Searching
Understand the problem of finding the only unpaired element in an array, and a few approaches to solve it.
Finding Maximum Size Square in a Matrix Filled With Ones
Filed under Algorithms
Learn how to find the maximum square size filled with ones in a matrix that contains only zeros and ones.
The Most Efficient Way to Implement an Integer Based Power Function
Filed under Algorithms
Learn about different ways to implement an integer-based power function and compare their efficiency.
Finding the Next Smaller Element for Each Element in an Array
Filed under Algorithms
Learn a few algorithms for finding the next smaller element for each element in an array.
Algorithms to Check If a Number Is a Power of 2
Filed under Math and Logic
Understand the problem of verifying if a number is a power of two, and a few ways to approach it.
Minimum Number of Steps to Reduce Number to One
Filed under Algorithms
A quick and practical overview of reducing a number to one using the minimum number of operations.
Negative Weights Using Dijkstra’s Algorithm
Filed under Graph Traversal
A quick and practical introduction to dealing with negative weights while using Dijkstra’s algorithm.
Pairing Socks From a Pile Efficiently
Filed under Algorithms, Math and Logic
A quick and practical overview of the sock pairing algorithm.
Finding the Shortest Path in a Graph Visiting All Nodes
Filed under Graph Traversal, Graphs, Path Finding
A quick and practical guide to finding the shortest path in a graph visiting all nodes.