20 lines
		
	
	
		
			1.3 KiB
		
	
	
	
		
			Markdown
		
	
	
	
	
	
			
		
		
	
	
			20 lines
		
	
	
		
			1.3 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 in Java](https://www.baeldung.com/java-balanced-binary-tree)
 | ||
| - [Overview of Combinatorial Problems in Java](https://www.baeldung.com/java-combinatorial-algorithms)
 | ||
| - [Prim’s Algorithm with a Java Implementation](https://www.baeldung.com/java-prim-algorithm)
 | ||
| - [Maximum Subarray Problem in Java](https://www.baeldung.com/java-maximum-subarray)
 | ||
| - [How to Merge Two Sorted Arrays in Java](https://www.baeldung.com/java-merge-sorted-arrays)
 | ||
| - [Median of Stream of Integers using Heap in Java](https://www.baeldung.com/java-stream-integers-median-using-heap)
 | ||
| - More articles: [[<-- prev]](/algorithms-miscellaneous-4) [[next -->]](/algorithms-miscellaneous-6)
 | ||
| 
 |