HashMap in JAVA
Hashing Hashing is the process of converting an object into an integer value. For indexing and faster searches, this is […]
Programming
Preorder Tree Traversal
qAny process for visiting all of the nodes of a binary tree in some order is called a binary tree traversal.
Bubble Sort
Bubble Sort Explanation: You can see the video for explanation of bubble sort. https://www.youtube.com/watch?v=sA4J928fj0k&t=148s Source Code: #include<bits/stdc++.h> int main() {
Structured Programming Language
Write a Program to find factorial of a integer number N
Input How factorial works by using recursion 5 factorial(5) =5*factorial(5-1) =5*factorial(4) =5*{4*factorial(4-1)} =5*4*factorial(3) =5*4*{3*factorial(3-1)} =5*4*3*factorial(2) =5*4*3*{2*factorial(2-1)} =5*4*3*2*factorial(1) =5*4*3*2*{1*factorial(1-1)} =5*4*3*2*1*factorial(0) =5*4*3*2*1*{1}
Structured Programming Language
Write a program to swap two numbers using pointers
Source Code: /*C program to swap two numbers using pointers.*/#include<stdio.h> // function : swap two numbers using pointersvoid swap(int *a,int