C Programming

List of 100 Game Engines
Blog

List of Top 100 Game Engines Written in C/C++

A game engine is a dedicated software or an architecture, or program that developers use for creating games. It provides developers with a way of adding physics, rendering, AI and other components, libraries and tools without programming them. They do require advanced programming experience and at the same time highly customizable. Game engines also provide limitless possibilities to develop the game.

,
Ternary Operator with Examples in C
C Programming: Different Articles on C Programming

Ternary Operator with examples in C

In C Programming, ternary operator allows executing different code depending on the value of a condition. The returned value is the result of the expression when the code is executed. The main advantage of using ternary operator is to reduce the number of lines of code and improve the performance of application. In C, the real utility of ternary operator is that it is an expression instead of a statement i.e. you can have it on the right-hand side (RHS) of a statement. So you can write certain code statements more concisely.

, ,
Base 64 Encoding and Decoding
C Programming Source Code

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.

, , ,
Kruskal's Algorithm
C Programming Source Code

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.

,
Scroll to Top