Search & Sort
Linear Search: O(n) int linear_search ( int ar [], int n , int key ){ for ( int i = 0 ; i < n ; i ++ ){ if ( ar ...
Linear Search: O(n) int linear_search ( int ar [], int n , int key ){ for ( int i = 0 ; i < n ; i ++ ){ if ( ar ...
slide link: https://www.slideshare.net/PritamGolder/knapsack-algoritm
#include<stdio.h> #include<conio.h> int sum=0; int max(int a,int b) { if(a>b) return a; else return b; } v...
Frequency: Frequency is the number of occurence/observation per group/class. Frequency Table: A frequency table is constructed by arra...
Bonds in Semiconductors: In semiconductors, bonds are formed by sharing of valence electrons. Such bonds are called co-valent bond. The ...
Identify the Following Variables according to their variable type and level of measurement: Model of a car entering a parking lot. Siz...
Scale / Level of measurement: Level of measurement or scale of measure is a classification that describes the nature of information within...
Constant : A constant is any characteristics, number, or quantity that can be measured or counted. Its value cannot be changed. Variable ...
Statistics: According to Bowly, "Statistics is the science of counting." According to W.I. King "Statistics is the branch ...
"A semiconductor is a substance which has resistivity (10−4 to 0.5 Ωm) in between conductors and insulators e.g. germanium, silicon, ...
1. Which of the following is not a stable sorting algorithm in its typical implementation. a. Insertion Sort ...
ইনসার্শন সর্ট : ইনসার্শন সর্ট - এ অ্যারেকে ২টি ভাগে ভাগ করা হয়। একটি সর্টেড অংশ এবং অন্যটি আনসার্টেড অংশ। এরপর আনসার্টেড অংশ থেকে প্রতিব...
Go to these sites and read through. No need to implement the code. Actually no need to look at the code. Just, read the theory. We'll...