By looking at the “classical” Bubble sort there can be found that the original algorithm is so unoptimized.
Simple Java implementation of the Bubble sort algorithm.
Simple java implementation of “Fisher-Yates shuffle” algorithm with modification from Richard Durstenfeld. Also, this algorithm was popularized by Donald Knuth as “Algorithm P (Shuffling)” or “Knuth shuffle”.
A simple iterative solution for LeetCode problem – Binary Search.
Iterative implementation of “binary search” in java.
It’s a very popular task to validate opening/closing brackets (as well as parentheses) in a text or string.