C Algorithm – Reverse a String using Stack
Venkatesan Prabu
C Algorithm – Evaluation of Postfix Expression – Data Structure -Given a string, reverse it using stack. For example “GeeksQuiz” should be converted
Browsing Category
c programming
30 posts
C Algorithm – Introduction to Stack
C Algorithm -Introduction to Stack – Data Structure -Stack is a linear data structure which follows a particular order in which the operations
C Programming-Swap all odd and even bits
Given an unsigned integer, swap all odd bits with even bits. For example, if the given number is 23 (00010111), it should be converted to 43 (00101011).
C Programming-Binary representation of a given number
C Programming – Binary representation of a given number – Bit Algorithm – Write a program to print Binary representation of a given number.
C Program to find whether a no is power of two
C Program to find whether a no is power of two – Bit Algorithm – Given a positive integer, write a function to find if it is a power of two or not.
C Programming – Find if there is a path between two vertices in a directed graph
C Programming – Find if there is a path between two vertices in a directed graph – check whether there is a path from the first given vertex to second.
C Programming – Matrix Chain Multiplication
C Programming – Matrix Chain Multiplication – Dynamic Programming MCM is an optimization problem that can be solved using dynamic programming.
C Programming-Backtracking Set 1 (The Knight’s tour problem)
C Programming-Backtracking Set 1 (The Knight’s tour problem) – Backtracking – Backtracking is an algorithmic paradigm that tries different solutions until finds a solution that “works”. Problems which are typically solved using backtracking technique have following property in common.
C Programming-Print all possible strings that can be made by placing spaces
C Programming-Print all possible strings that can be made by placing spaces – Searching and Sorting – The idea is to use recursion and create a buffer.
C Program Count 1’s in a sorted binary array
C Program Count 1’s in a sorted binary array – Searching and Sorting – A simple solution is to linearly traverse the array. The time complexity of the simple solution is O(n). We can use Binary Search to find count in O(Logn) time.
