/* Read n value into array and sort them into ASCENDING ORDER (BUBBLE SORT METHOD) */ #include<stdio.h> #include<conio.h> void main() { int a[100],i,j,n,t;
Author: Mohit Arora
Hi, I am Mohit Arora , a passionate blogger and addicted reader. Currently working as a Technology Analyst in INFOSYS Ltd.
You can check my other blog - CatchUpdates.com
You can connect with me on Instagram Or Quora And Linkedin as well.
Going for an interview and worried? Do not panic. I have brought something useful for you. In most technical interviews candidates are asked to solve programming questions. You are given a short period of time for solving them. Most of the time they will not ask you to solve a lengthy questions having a large […]
// Aim: Lexical Analyzer #include<conio.h> #include<string.h> #include<ctype.h> #include<stdio.h>
1. The complexity of linear search algorithm is a. O(n) b. O(log n) c. O(n2) d. O(n log n)
/* Binary Search */ /* Condition: List must be sorted order and search the value at mid location of the list */
/* Program To Print The System Date #include<conio.h> #include<stdio.h> #include<dos.h>