Category: C Programming Source Code

Print Pyramids and Diamonds Shapes in C Programming

So, here in this article I will demonstrate how you can print pyramids and diamonds using for loop and if condition using C Programming. Building a pyramid in c programming is quite easy, but you must have the understanding of how for loop works. With some slight modifications you can print different shapes as well.

The C++ program to find the Shortest Path

This C++ program finds the shortest path between two cities, provided that the map of the two...

Customizable Information Box Library in C

This C code provides a simple and customizable implementation for creating text boxes that can be used to display tips, hints, or information in a game or application. The code is designed to be beginner-friendly and easy to integrate into C programs.

PC to PC Communication in C

This is a C program to demonstrate PC to PC Communication via RS232 port. Chat with only 3-wire connection. This program is tested with Turbo C++ editor Version 3.0. How ever, authors are not responsible for any damages that may happen to your computer. Please contact us if any problem exits.

Graphical Piano – “My Piano” – C++

MyPiano 3.0 is a simple piano developed in C++ using graphics functions. By using this piano,user can play, record music etc. This is the third version of MyPiano source code.

Making Mouse Pointers

How to create the mouse pointers in c language. Different shapes can be given to the mouse pointer by changing the values of the cursor variable array.

Find the longest common sub-sequence between two strings: Dynamic Programming Algorithm

This C program finds the longest common sub-sequence between two strings. It implements the most famous dynamic programming algorithm. Dynamic programming is a computational technique used to solve complex problems by breaking them down into smaller subproblems and solving each subproblem only once, storing the solution to each subproblem and using it to solve larger problems.

Smith-Waterman Algorithm – The Optimal Pairwise Sequence Alignment Problem

The Smith-Waterman algorithm is used for comparing two sequences, typically biological sequences like DNA, RNA, or proteins. It finds the local similarities between the sequences, identifying regions where they match or align.