This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Program to delete an element from an array | |
**/ | |
#include<stdio.h> | |
#include<stdlib.h> | |
int main(void) | |
{ | |
int *array, size; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* A Stack is a last in, first out (LIFO) abstract data type and data | |
* structure.It is characterized by three fundamental operations: push, | |
* pop and stack top. | |
* PUSH : The push operation adds a new item to the top of the stack, or | |
* initializes the stack if it is empty, but if the stack is full and | |
* does not contain more space to accept the given item it is considered | |
* as an Overflow state (It means that the stack is overloaded or no more | |
* space for new item). |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/** | |
* Shift operators shift the bits in an integer variable by a specified | |
* number of positions. The << operator shifts bits to the left, and the >> | |
* operator shifts bits to the right. The syntax for these binary operators | |
* is x << n and x >> n | |
* Each operator shifts the bits in x by n positions in the specified | |
* direction. For a right shift, zeros are placed in the n high-order bits | |
* of the variable; for a left shift, zeros are placed in the n low-order | |
* bits of the variable. | |
* Here are a few examples: |
OlderNewer