24 lines
1.7 KiB
Markdown
24 lines
1.7 KiB
Markdown
## Algorithms - Miscellaneous
|
||
|
||
This module contains articles about algorithms. Some classes of algorithms, e.g., [sorting](/../algorithms-sorting) and
|
||
[genetic algorithms](/../algorithms-genetic), have their own dedicated modules.
|
||
|
||
### Relevant articles:
|
||
|
||
- [Converting Between Byte Arrays and Hexadecimal Strings in Java](https://www.baeldung.com/java-byte-arrays-hex-strings)
|
||
- [Reversing a Binary Tree in Java](https://www.baeldung.com/java-reversing-a-binary-tree)
|
||
- [Find If Two Numbers Are Relatively Prime in Java](https://www.baeldung.com/java-two-relatively-prime-numbers)
|
||
- [Knapsack Problem Implementation in Java](https://www.baeldung.com/java-knapsack)
|
||
- [How to Determine if a Binary Tree is Balanced](https://www.baeldung.com/java-balanced-binary-tree)
|
||
- [The Caesar Cipher in Java](https://www.baeldung.com/java-caesar-cipher)
|
||
- [Overview of Combinatorial Problems in Java](https://www.baeldung.com/java-combinatorial-algorithms)
|
||
- [Prim’s Algorithm](https://www.baeldung.com/java-prim-algorithm)
|
||
- [Maximum Subarray Problem](https://www.baeldung.com/java-maximum-subarray)
|
||
- [How to Merge Two Sorted Arrays](https://www.baeldung.com/java-merge-sorted-arrays)
|
||
- [Median of Stream of Integers using Heap](https://www.baeldung.com/java-stream-integers-median-using-heap)
|
||
- [Kruskal’s Algorithm for Spanning Trees](https://www.baeldung.com/java-spanning-trees-kruskal)
|
||
- [Balanced Brackets Algorithm in Java](https://www.baeldung.com/java-balanced-brackets-algorithm)
|
||
- [Efficiently Merge Sorted Java Sequences](https://www.baeldung.com/java-merge-sorted-sequences)
|
||
- [Introduction to Greedy Algorithms with Java](https://www.baeldung.com/java-greedy-algorithms)
|
||
- More articles: [[<-- prev]](/../algorithms-miscellaneous-4)
|