Skip to content

Instantly share code, notes, and snippets.

@mycodeschool
mycodeschool / gcd.cpp
Last active Jan 12, 2021
GCD: Brute force and Euclid's algorithm
View gcd.cpp
#include<algorithm>
using namespace std;
int euclid_gcd(int a, int b)
{
while (b != 0)
{
int r = a % b;
a = b;
@mycodeschool
mycodeschool / Stack_ArrayImplementation.C
Last active Dec 4, 2020
This is a basic array based implementation of stack data structure in C.
View Stack_ArrayImplementation.C
// Stack - Array based implementation.
// Creating a stack of integers.
#include<stdio.h>
#define MAX_SIZE 101
int A[MAX_SIZE]; // integer array to store the stack
int top = -1; // variable to mark top of stack in array
// Push operation to insert an element on top of stack.
@mycodeschool
mycodeschool / Stack_ArrayImplementation_OOP.cpp
Created Oct 8, 2013
An object oriented implementation of stack using arrays in C++.
View Stack_ArrayImplementation_OOP.cpp
// Stack - Object oriented implementation using arrays
#include <iostream>
using namespace std;
#define MAX_SIZE 101
class Stack
{
private:
int A[MAX_SIZE]; // array to store the stack
int top; // variable to mark the top index of stack.
@mycodeschool
mycodeschool / BalancedParentheses.cpp
Created Oct 29, 2013
C++ Program to check for balanced parentheses in an expression using stack.
View BalancedParentheses.cpp
/*
C++ Program to check for balanced parentheses in an expression using stack.
Given an expression as string comprising of opening and closing characters
of parentheses - (), curly braces - {} and square brackets - [], we need to
check whether symbols are balanced or not.
*/
#include<iostream>
#include<stack>
#include<string>
using namespace std;
View Queue_CircularArrayImplementation.cpp
/* Queue - Circular Array implementation in C++*/
#include<iostream>
using namespace std;
#define MAX_SIZE 101 //maximum size of the array that will store Queue.
// Creating a class named Queue.
class Queue
{
private:
int A[MAX_SIZE];
@mycodeschool
mycodeschool / DoublyLinkedList.c
Created Nov 12, 2013
Doubly Linked List implementation in C
View DoublyLinkedList.c
/* Doubly Linked List implementation */
#include<stdio.h>
#include<stdlib.h>
struct Node {
int data;
struct Node* next;
struct Node* prev;
};
@mycodeschool
mycodeschool / Queue_LinkedList.c
Last active Nov 19, 2020
Linked List implementation of Queue.
View Queue_LinkedList.c
/*Queue - Linked List implementation*/
#include<stdio.h>
#include<stdlib.h>
struct Node {
int data;
struct Node* next;
};
// Two glboal variables to store address of front and rear nodes.
struct Node* front = NULL;
struct Node* rear = NULL;
View PostfixEvaluation.cpp
/*
Evaluation Of postfix Expression in C++
Input Postfix expression must be in a desired format.
Operands must be integers and there should be space in between two operands.
Only '+' , '-' , '*' and '/' operators are expected.
*/
#include<iostream>
#include<stack>
#include<string>
@mycodeschool
mycodeschool / InfixToPostfix.cpp
Created Dec 9, 2013
Infix to Postfix conversion in C++ using stack. We are assuming that both operators and operands in input will be single character.
View InfixToPostfix.cpp
/*
Infix to postfix conversion in C++
Input Postfix expression must be in a desired format.
Operands and operator, both must be single character.
Only '+' , '-' , '*', '/' and '$' (for exponentiation) operators are expected.
*/
#include<iostream>
#include<stack>
#include<string>
View LevelOrder_CPP.cpp
/* Binary tree - Level Order Traversal */
#include<iostream>
#include<queue>
using namespace std;
struct Node {
char data;
Node *left;
Node *right;
};
You can’t perform that action at this time.