# Category - C Programming

## C Algorithm – Evaluation of Postfix Expression

C Algorithm - Evaluation of Postfix Expression - Data Structure -The Postfix notation is used to represent algebraic expressions.

## C Algorithm – Infix to Postfix Conversion using Stack

C Algorithm - Infix to Postfix Conversion using Stack - Data Structure - Infix expression:The expression of the form a op b.

## C Programming – Ugly Numbers

C Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every step we choose the smallest one

## C Program-Swap two nibbles in a byte

C Program Swap two nibbles in a byte - Bit Algorithm - A nibble is a four-bit aggregation, or half an octet. There are two nibbles in a byte.

## C Programming – Inserting a node in Linked List | Set 2

C Programming -Time complexity of append is O(n) where n is number of nodes in linked list. Since there is a loop from head to end, the function does O(n)

## C Programming – K’th Smallest/Largest Element in Unsorted Array Expected Linear Time

Given an array and a number k where k is smaller than size of array, we need to find the k’th smallest element in the given array.

## C Programming – Reservoir Sampling

Reservoir sampling is a family of randomized algorithms for randomly choosing k samples from a list of n items, where n is either a very large.

## C Programming – Shuffle a given array

Given an array, write a program to generate a random permutation of array elements. This question is also asked as “shuffle a deck of cards” or “randomize a...

## C program to sort a string in alphabetic order

C program to sort a string in alphabetic order - C Programming- if user will enter a string "programming" then output will be "aggimmnoprr" or output string

## C program to check subsequence

C program to check subsequence - C Programming - User will input two strings and we find if one of the strings is a subsequence of other.