Singly Linklist in C++ (insertion at satart,middle and end. Searching in linklist. Deletion of any node)

#include <iostream> using namespace std; struct node {     int data;     struct node *next; }; int main() {     node *head;     node *temp;     node *last;     last=0;     int choice;    do     {         temp=new node();         cout<<"Enter values in a node:"<<endl;        ...

Read More

Binary Search in C++

#include <iostream>using namespace std; void binarysearch(int arr[],int s,int size);void binarysearch(int arr[],int s,int size){    int lower=0,higher=size-1,m;    while(lower<=higher)    {        m=(lower+higher)/2;        if(s==arr[m])        {        cout<<"Search...

Read More

Selection sorting Dynamically

Worst-Complexity: n ^ 2 Average-Complexity: n ^ 2 Best-Complexity: n ^ 2 Space-Complexity:  1 #include<iostream> using namespace std; /*********************sorting function********************/ void selection_Sort(int arr[], int n){    int i, j, min;    for (i = 0; i < n-1; i++)    {        min = i;        for (j = i+1; j...

Read More

"Infix to Post-fix" conversion and "parenthesis check using "User define" stacks C++

#include<iostream> using namespace std; char stack[100]; // char postfix[100]; char exp[100]; // mathematical expression entered by the user int top=-1; /**********************************************/ void push1(char newitem) {                 if(top=='\0')                 {                                ...

Read More

A Program which uses linear searching? C++

Starts from the base index and compare it with the rest of the element of an array. If the serached index found, it returns 1 else it returns -1. #include<iostream> using namespace std; /********************************************/ int linearSearch(int n[],int s,int size)     {         for(int i=0;i<size;i++)         {            ...

Read More