Ten Most Recommended C books for Expert Programmers
C is a great programing language to start as a beginner programmer. However, it is also an...
Read More
Tag: C Programming
The “Hello, World!” Program in C
This is a simple “Hello, World!” C program to display “Hello, World!” text on the...
Read More![The C++ Modulus Operator [mod or % operator]](https://cdn.mycplus.com/mycplus/wp-content/uploads/2017/10/Modulus-Operator-mod-627x376.png)
The C++ Modulus Operator [mod or % operator]
The C++ language provides a built-in mechanism, the modulus operator (mod or %), that computes the remainder that results from performing integer division.
Read More
Find the middle element of linked list in C
In order to find middle element of linked list in one pass, you need to maintain two pointers, one increment at each node while other increments after two nodes at a time. By having this arrangement, when first pointer reaches end, second pointer will point to middle element of linked list.
Read More"C is one of the foundations for modern information technology (IT) and computer science (CS) and the base for almost all popular programming languages."
Harry H. Cheng - University of California
C Implementation of Base64 Encoding and Decoding
Base64 encoding and decoding schemes are commonly used to encode binary data. Normally this is required when textual data needs to be transferred over the network or similar media and make sure that data is transferred without any modification. Base64 is commonly used in a number of applications, including email via MIME, and storing complex data in XML. This is a very simple implementation of base64 encoding and decoding in C programming language. There are number of C libraries available for encoding and decoding as well i.e. libb64, OpenSSL Base64, Apple’s Implementations, arduino-base64 etc.
Read More
Kruskal’s Algorithm
This is the implementation of Kruskal’s Algorithm in C and C++ Programming Languages. This algorithm is directly based on the generic MST (Minimum Spanning Tree) algorithm. Kruskal’s algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. It finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the tree is minimized.
Read More
Porter’s Algorithm in C
Originally written in 1979 at Computer Laboratory, Cambridge (England), it was reprinted in 1997 in the book “Readings in Information Retrieval”. Initially it was written in BCPL language. Here is the list of implementations in other programming languages including C, Java and Pearl implementations done by author himself.
Read More