Lab: Binary Search, Quick sort, Merge Sort
Site: | DIU Blended Learning Center |
Course: | Algorithm -SMAH(Fall 2022) |
Book: | Lab: Binary Search, Quick sort, Merge Sort |
Printed by: | Guest user |
Date: | Sunday, 16 March 2025, 3:38 AM |
Binary Search
function binary_search(A, n, searchItem)
L := 0
R := n − 1
while L ≤ R do
m := floor((L + R) / 2)
if A[m] < searchItem then
L := m + 1
else if A[m] > searchItem then
R := m - 1
else:
return m
return unsuccessful
Quick Sort & Merge Sort
Marge Sort
Date Algorithm : PC-A 16/06/2021 Lab Class https://drive.google.com/file/d/1335LHqRb4BRUgiVyUNfr8ubvN0V86W5Y/view Lab Class VIVA - G1 https://drive.google.com/file/d/1_zwJrirvOn__J_FeS4Z4TNib4DcBmTjC/view?usp=drive_web VIVA - G2 https://drive.google.com/file/d/1zb9JwMMb99Mq8P3n9OS9MrR1ALy87BKZ/view?usp=drive_web VIVA - G1 https://drive.google.com/file/d/15Jv0BbwgDp7nC0sisQoyZqk2PrGZoYez/view?usp=drive_web Lab+VIVA G2 https://drive.google.com/file/d/1r3DmIUNF49_ONBiHpeSp9veNbbDSQBFI/view Date Algorithm : PC-B 15/06/2021 Lab Class 22/06/2021 Lab Class https://drive.google.com/file/d/1gMIqzSKTOQSRMap2hqupeJemeLpaMd68/view VIVA - G1 https://drive.google.com/file/d/10aQ22Z3EBHBXmYBcCNVDsRFnEqpo3WMM/view?usp=drive_web VIVA - G2 https://drive.google.com/file/d/1yc4vw8viknyKvxW3PiAN1b__ElDK1u_0/view?usp=drive_web Lab+VIVA VIVA Lab+VIVA