Binary Search in C
Binary Search is a search algorithm that finds the position of a target element within a sorted list. Binary search compares the target element
Binary Search is a search algorithm that finds the position of a target element within a sorted list. Binary search compares the target element
A Linear search or sequential search is a method for finding an element within a list sequentially. It checks each element in the list
Below coding is the program to generate n number of series. For example: (1*1)+(2*2)+(3*3)+……+(n*n) //GENERATING THE SERIES #include<stdio.h> #include<conio.h> void main() { int n,i,sum=1;
First In First Out(FIFO) is known as first come first served. It is also known as FCFS is the simplest scheduling algorithm. Below coding
A prime number is a natural number that is not a product of two smaller natural numbers. The natural number 1 is not a
The Fibonacci series is the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144,
A factorial is a function that multiplies a whole number by every number below it. For example: 6! = 6 x 5 x 4
Below code is the program to reverse a string in assembly language. ;REVERSE STRING NAME “REVERSE” ORG 100H JMP START STRING1 DB ‘EGAUGNAL YLBMESSA’
Below program is the code for displaying the message “Hello World!”. name “hi” org 100h jmp start msg: db “Hello, World!”,0dh,0ah,24h start: mov dx,
Below coding is the example of addition and subtraction in assembly language. name “add-sub” org 100h mov al,5 mov bl,10 add bl,al sub bl,1