Explore algorithms for rotating two-dimensional matrices.
Also find me here:
Baeldung Author
Rafael Engibaryan
I'm a software architect and engineer. My main experience is in desktop development and system programming using C++ tech stack, and web back-end development in Java and Python ecosystems. I'm very passionate about math, algorithms, data structures, and software architecture.
Here's what I've written (so far):
Baeldung on Computer Science
- >All
- Trees (4)
- Data Structures (4)
- Graphs (3)
- Sorting (2)
- Algorithms (2)
- Searching (1)
- Path Finding (1)
- Math and Logic (1)
Patience Sort Algorithm
Filed under Sorting
Explore the patience sort algorithm.
Ukkonen’s Suffix Tree Algorithm
Filed under Searching
Explore Ukkonen’s algorithm for building suffix trees in linear time.
Finding Strongly Connected Components: Tarjan’s Algorithm
Filed under Algorithms, Graphs
Learn about the Tarjan’s algorithm for finding strongly connected components in directed graphs.
Tournament Sort Algorithm
Filed under Sorting
Explore the tournament sort algorithm.
Network Flow: Edmonds-Karp Algorithm
Filed under Algorithms, Graphs
Learn about the Edmonds-Karp algorithm for finding the maximum flow in network graphs.
Guide to Splay Trees
Filed under Trees
Learn about the Splay Tree data structure.
All-Pairs Shortest Paths: Johnson’s Algorithm
Filed under Path Finding
Learn about the Johnson’s algorithm.
Level-order Traversal of Binary Tree
Filed under Trees
Learn about the level-order traversal of binary trees.