Author Archives: Tunde A

About Tunde A

My name is Tunde Ajetomobi, a Tech Enthusiast and Growth Hacker. I enjoy creating helpful content that solves problem across different topics. Codezclub is my way of helping young aspiring programmers and students to hone their skills and find solutions on fundamental programming languages.

C Program for Sorting an Array using Shell Sort using Knuth increments

Shell Sort using Knuth increments Write a C Program for Sorting an Array using Shell Sort using Knuth increments.  Here’s simple C Program for Sorting an Array using Shell Sort using Knuth increments in C Programming Language. Shell Sort Shell Sort is mainly a variation of Insertion Sort.

C Program for Sorting an Array using Shell Sort

Sorting an Array using Shell Sort Write a C Program for Sorting an Array using Shell Sort.  Here’s simple C Program for Sorting an Array using Shell Sort in C Programming Language. Shell Sort Shell Sort is mainly a variation of Insertion Sort.

C Program for Sorting an Array using Insertion Sort

Sorting an Array using Insertion Sort Write a C Program for Sorting an Array using Insertion Sort.  Here’s a simple C Program for Sorting an Array using Insertion Sort in C Programming Language. Insertion Sort Insertion sort is a simple sorting algorithm that works the way we sort playing cards in our hands.

Demo Example to find Shortest Paths using Bellman-Ford Algorithm

Shortest Paths using Bellman-Ford Algorithm Write a C  Demo Program to find Shortest Paths using Bellman-Ford Algorithm Example. Here’s a simple C Program to find Shortest Distances or Paths using Bellman-Ford Algorithm with output in C Programming Language. Bellman-Ford Algorithm The Bellman-Ford algorithm is a graph search algorithm that finds the shortest path between a given source vertex and all other… Read More »

C Program to implement Topological Sorting Algorithm Example

Topological Sorting Algorithm Write a C Program to implement Topological Sorting Algorithm Example. Here’s simple Program to implement Topological Sort Algorithm Example in C Programming Language. Topological Sorting Topological sorting or Topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge (u v) from vertex u to vertex v, u comes before v in the ordering. For instance, the vertices of the graph may… Read More »

C Program for Minimum Spanning Tree using Kruskal’s Algorithm Example

Minimum Spanning Tree using Kruskal’s Algorithm Write a C Program for Creating Minimum Spanning Tree using Kruskal’s Algorithm Example. Here’s simple Program for creating minimum cost spanning tree using kruskal’s algorithm example in C Programming Language. Kruskal’s Algorithm Kruskal’s algorithm is a minimum-spanning-tree algorithm which finds an edge of the least possible weight that connects any two trees in the… Read More »

C Program for Creating Minimum Spanning Tree using Prim’s Algorithm

Minimum Spanning Tree using Prim’s Algorithm Write a C Program for Creating Minimum Spanning Tree using Prim’s Algorithm. Here’s simple Program for minimum cost spanning tree using prim’s algorithm example in C Programming Language. Prim’s Algorithm   Prim’s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. It finds… Read More »

C Program to find Shortest Path Matrix by Modified Warshall’s Algorithm

Shortest Path Matrix by Modified Warshall’s Algorithm Write a C Program to find Shortest Path Matrix by Modified Warshall’s Algorithm. Here’s simple Program to find Shortest Path Matrix by Modified Warshall’s Algorithm in C Programming Language. Modified Warshall’s Algorithm The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem. The problem is to find… Read More »