Java Algorithms, Problems & Programming Examples

Our list of Java examples cover a wide range of programming areas in Computer Science. This section contains list of topics on Algorithms, Problems and their Solutions using Java Programming Language. These topics cover a wide range of problems encountered not only in Computer Science but also in other areas of Engineering. Every example program on these topics include the description of the program, Java code as well as output of the program.

Here is the listing of broad categories of topics:

This section deals with categories of Numerical Problems & Algorithms. They include Programs on finding Inverse of a Matrix, Programs on Gauss Jordan Elimination and Gauss Seidel Method, Programs on Bandwidth Reduction, Programs on Sparse Matrix, Programs on Determinants, Programs on Conjugate Method, Programs on Compute Local Optima, Programs on Fisher-Yates Algorithm, Programs on Fermat Factorization Algorithm, Programs on Horner Algorithm, Programs on Gaussian Elimination Algorithm, Programs on Pollard Rho Algorithm and Bin Packing Algorithm. The below link guides us through all the Category of Programs mentioned above.

https://www.sanfoundry.com/java-programming-examples-numerical-problems-algorithms/

 

In this section, we have Programs on Combinatorial Problems & Algorithms. They include Programs on Quick sort, Merge Sort, Counting Sort and Stooge Sort, Programs on Interpolation Search Algorithm, Programs on Uniform Binary Search, Programs on Median and Selection, Programs on Permutation Algorithms, Programs on Combinations and Subsets, Programs on Generating Partitions, Programs on Random Edge Generation and Random Edge Selection Methods. The following link will guide you to the various programs that belong to the above mentioned categories.

https://www.sanfoundry.com/java-programming-examples-combinatorial-problems-algorithms/

 

The following section gives a collection of Java Programs which are categorized into various Categories like Programs on Graph connectivity using BFS & DFS, Program on Tarjan Algorithm, Topological Sorting, Programs on Dijkstra’s Algorithm using Set & Queue, Program on Bellmanford Algorithm, Program on Johnson’s Algorithm, Programs on Transitive Reduction, Programs on Chinese Postman Problems, Programs on Vertex Connectivity, Programs on Trees like Splay Tree, Threaded Binary Tree, Expression Tree & Fenwick Tree, Programs on Planarity Detection and Embedding. The link below guides us through all of these Programs.

https://www.sanfoundry.com/java-programming-examples-graph-problems-algorithms/

 

The below categories deal with the Programs on Hard Graph Problems & Algorithms. They include Programs on Vertex Cover, Programs on finding Largest Independent Set Size using Binary & N-ary Tree, Program on Nearest Neighbour Algorithm, Program on Knight’s Tour Problem, Programs on DAG, Program on Greedy Coloring, Program on 4-Color Problem, Program on Vizing’s Theorem and Programs on Feedback Edge. The following link displays all these categories of Programs.

https://www.sanfoundry.com/java-programming-examples-hard-graph-problems-algorithms/

 

In this section, we have various Programs on Computational Geometry Problems & Algorithms. These include Programs on Robust Geometric Primitives, Programs on Determinants, Program on Delaunay Triangulation Algorithm, Programs on finding Convex Hull by implementing Jarvis March & Quick Hull Algorithm, Program on Fortune’s Sweep2 Code, Program on Lloyd’s Algorithm, Program on Bowyer-Watson Algorithm, Programs on Nearest Neighbor Search, Programs on finding Point Location Using Slab Method and Trapezoidal Decomposition, Programs on Intersection Detection, Programs on Bins, Program on Housdorff based Image Comparison, Programs on Sweepline Algorithm and Bresenham Line Algorithm. The link below illustrates all the Programs that are Categorized as above.

https://www.sanfoundry.com/java-programming-examples-computational-geometry-problems-algorithms/

 

This section deals with categories of Set & String Problems & Algorithms. They include Programs on Set Cover, Programs on Exhaustive Search Algorithm and Heuristic Approach for Set Packing, Program on Naive String Matching, Program on Knuth-Morris-Pratt Algorithm, Program on Aho-Corasick Algorithm, Programs on Wagner and Fisher Algorithm for online String Matching, Program on Caesar Cypher, Program on MD5 Algorithm and Program on Longest Common SubSequence. The link below displays all the programs on Set & String Problems & Algorithms.

https://www.sanfoundry.com/java-programming-examples-set-string-problems-algorithms/

 

In this section, we have various Programs on Data-Structures. These include Programs on Hash Tables chaining with Singly Linked Lists, Program on Hash List, Program on Prefix Hash Tree, Program on Rolling Hash & Min Hash, Program on Pairing Heap, Program on Min Heap, Program on Max Heap, Program on Unrolled Linked List, Program on VList, Program on Dequeue, Program on Sorted List, Program on Array Deque, Programs on Vector, Programs on Stack, Program on Segment Tree, Program on Tree Set, Programs on Queue and Programs on Linked List. The link below guides us through all of these Programs.

https://www.sanfoundry.com/java-programming-examples-data-structures/

 

This section deals with categories of Collection API. They include Program on HashSet API, Program on LinkedList API, Program on TreeMap API, Program on EnumMap API, Program on Stack API, Program on PriorityQueue API, Program on LinkedBlockingDeque API, Program on SynchronosQueue API, Program on ArrayDeque API and Program on Attribute API. The following link will guide us through all the Programs mentioned above.

https://www.sanfoundry.com/java-programming-examples-collection-api/

 

Wish you the best in your endeavor to learn and master Java Algorithms!