0% found this document useful (0 votes)

2 views

CORE - 14 - Algorithm Design Techiniques

The document contains C++ implementations of various algorithms including Linear Search, Binary Search, Merge Sort, Quick Sort, Heap Sort, Breadth-First Search (BFS), Depth-First Search (DFS), Bubble Sort, Insertion Sort, and Selection Sort. Each algorithm is presented with code snippets, example outputs, and explanations of their functionality. The document serves as a comprehensive guide for understanding and implementing these fundamental algorithms in C++.

Uploaded by

subhampallai7

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

2 views

CORE - 14 - Algorithm Design Techiniques

Uploaded by

subhampallai7

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 14

1.

Write a Linear Search Algorithm in C++

#include <iostream>
using namespace std;

int linearSearch(int arr[], int size, int key) {
for(int i = 0; i < size; i++) {
if(arr[i] == key) {
return i; }
}
return -1;
}

int main() {
int arr[] = {5, 3, 8, 6, 7};
int size = sizeof(arr) / sizeof(arr[0]);
int key;

cout << "Enter the number to search: ";
cin >> key;

int result = linearSearch(arr, size, key);

if(result != -1) {
cout << "Element found at index " << result << endl;
} else {
cout << "Element not found in the array." << endl;
}

return 0;
}

OUTPUT :

Enter the number to search: 8

Element found at index 2

Enter the number to search: 10
Element not found in the array.
2.Write a Binary Search Algorithm in C++

#include <iostream>
using namespace std;

int binarySearch(int arr[], int size, int key) {
int low = 0, high = size - 1;

while(low <= high) {
int mid = (low + high) / 2;

if(arr[mid] == key)
return mid;
else if(arr[mid] < key)
low = mid + 1;
else
high = mid - 1;
}

return -1;
}

int main() {
int arr[] = {2, 4, 6, 8, 10, 12, 14};
int size = sizeof(arr) / sizeof(arr[0]);
int key;

cout << "Enter the number to search: ";
cin >> key;

int result = binarySearch(arr, size, key);

if(result != -1)
cout << "Element found at index " << result << endl;
else
cout << "Element not found in the array." << endl;

return 0;
}

OUTPUT :

Enter the number to search: 10

Element found at index 4

Enter the number to search: 5
Element not found in the array.

3.Write a Merge Sort Algorithm in C++

#include <iostream>
using namespace std;

// Merge two halves
void merge(int arr[], int left, int mid, int right) {
int n1 = mid - left + 1; // size of left half
int n2 = right - mid; // size of right half

// Create temporary arrays
int L[n1], R[n2];

// Copy data to temp arrays
for(int i = 0; i < n1; i++)
L[i] = arr[left + i];
for(int j = 0; j < n2; j++)
R[j] = arr[mid + 1 + j];

// Merge the temp arrays back into arr[left..right]
int i = 0, j = 0, k = left;
while(i < n1 && j < n2) {
if(L[i] <= R[j]) {
arr[k] = L[i];
i++;
} else {
arr[k] = R[j];
j++;
}
k++;
}

// Copy remaining elements of L[], if any
while(i < n1) {
arr[k] = L[i];
i++;
k++;
}

// Copy remaining elements of R[], if any
while(j < n2) {
arr[k] = R[j];
j++;
k++;
}
}

// Merge sort function
void mergeSort(int arr[], int left, int right) {
if(left < right) {
int mid = (left + right) / 2;

// Sort first and second halves
mergeSort(arr, left, mid);
mergeSort(arr, mid + 1, right);

// Merge the sorted halves
merge(arr, left, mid, right);
}
}

// Print array
void printArray(int arr[], int size) {
for(int i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}

int main() {
int arr[] = {9, 4, 6, 2, 10, 1};
int size = sizeof(arr) / sizeof(arr[0]);

cout << "Original array: ";
printArray(arr, size);

mergeSort(arr, 0, size - 1);

cout << "Sorted array: ";
printArray(arr, size);

return 0;
}
OUTPUT :
Original array: 9 4 6 2 10 1
Sorted array: 1 2 4 6 9 10

4. Write a Quick Sort Algorithm in C++

#include <iostream>
using namespace std;

int partition(int arr[], int low, int high) {
int pivot = arr[high];
int i = low - 1;

for(int j = low; j < high; j++) {
if(arr[j] < pivot) {
i++;

swap(arr[i], arr[j]);
}
}

swap(arr[i + 1], arr[high]);

return i + 1;
}

void quickSort(int arr[], int low, int high) {
if(low < high) {

int pi = partition(arr, low, high);

quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}

void printArray(int arr[], int size) {
for(int i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}

int main() {
int arr[] = {7, 2, 1, 6, 8, 5, 3, 4};
int size = sizeof(arr) / sizeof(arr[0]);

cout << "Original array: ";
printArray(arr, size);

quickSort(arr, 0, size - 1);

cout << "Sorted array: ";
printArray(arr, size);

return 0;
}

OUTPUT :

Original array: 7 2 1 6 8 5 3 4
Sorted array: 1 2 3 4 5 6 7 8

5. Write a Heap Sort Algorithm in C++

#include <iostream>
using namespace std;

// Function to heapify a subtree rooted at index i
void heapify(int arr[], int n, int i) {
int largest = i; // Initialize largest as root
int left = 2 * i + 1; // left child index
int right = 2 * i + 2;// right child index

// If left child is larger than root
if(left < n && arr[left] > arr[largest])
largest = left;

// If right child is larger than largest so far
if(right < n && arr[right] > arr[largest])
largest = right;

// If largest is not root
if(largest != i) {
swap(arr[i], arr[largest]); // Swap root with largest
heapify(arr, n, largest); // Recursively heapify the affected
sub-tree
}
}

// Heap sort function
void heapSort(int arr[], int n) {
// Build max heap
for(int i = n / 2 - 1; i >= 0; i--)
heapify(arr, n, i);

// Extract elements from heap one by one
for(int i = n - 1; i > 0; i--) {
swap(arr[0], arr[i]); // Move current root to end
heapify(arr, i, 0); // Heapify the reduced heap
}
}

// Print the array
void printArray(int arr[], int size) {
for(int i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}

int main() {
int arr[] = {12, 11, 13, 5, 6, 7};
int size = sizeof(arr) / sizeof(arr[0]);

cout << "Original array: ";
printArray(arr, size);

heapSort(arr, size);

cout << "Sorted array: ";
printArray(arr, size);

return 0;
}
OUTPUT :

Original array: 12 11 13 5 6 7
Sorted array: 5 6 7 11 12 13

6. Write a Program to implement BFS in C++

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

class Graph {
int V; // number of vertices
vector<vector<int>> adj;

public:
Graph(int v) {
V = v;
adj.resize(V);
}

void addEdge(int u, int v) {
adj[u].push_back(v); // Add v to u's list
adj[v].push_back(u); // For undirected graph
}

void BFS(int start) {
vector<bool> visited(V, false);
queue<int> q;

visited[start] = true;
q.push(start);

cout << "BFS Traversal starting from node " << start << ": ";

while (!q.empty()) {
int node = q.front();
q.pop();
cout << node << " ";

for (int neighbor : adj[node]) {
if (!visited[neighbor]) {
visited[neighbor] = true;
q.push(neighbor);
}
}
}

cout << endl;
}
};

int main() {
Graph g(6);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 3);
g.addEdge(2, 4);
g.addEdge(3, 5);
g.addEdge(4, 5);

g.BFS(0);

return 0;
}

OUTPUT :

BFS Traversal starting from node 0: 0 1 2 3 4 5

7. Write a Program to implement DFS in C++

#include <iostream>
#include <vector>
using namespace std;

class Graph {
int V; // Number of vertices
vector<vector<int>> adj;

public:
Graph(int v) {
V = v;
adj.resize(V);
}

void addEdge(int u, int v) {
adj[u].push_back(v); // Add v to u's list
adj[v].push_back(u); // For undirected graph
}

void DFSUtil(int node, vector<bool>& visited) {
visited[node] = true;
cout << node << " ";

for (int neighbor : adj[node]) {
if (!visited[neighbor]) {
DFSUtil(neighbor, visited);
}
}
}

void DFS(int start) {
vector<bool> visited(V, false);
cout << "DFS Traversal starting from node " << start << ": ";
DFSUtil(start, visited);
cout << endl;
}
};

int main() {
Graph g(6);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 3);
g.addEdge(2, 4);
g.addEdge(3, 5);
g.addEdge(4, 5);

g.DFS(0);

return 0;
}

OUTPUT :
DFS Traversal starting from node 0: 0 1 3 5 4 2
8. Write a Program to implement Bubble Sort in C++

#include <iostream>
using namespace std;

void bubbleSort(int arr[], int n) {
for (int i = 0; i < n - 1; i++) {
bool swapped = false;

for (int j = 0; j < n - i - 1; j++) {
// Swap if the element is greater than the next one
if (arr[j] > arr[j + 1]) {
swap(arr[j], arr[j + 1]);
swapped = true;
}
}

// If no two elements were swapped, the array is already sorted
if (!swapped)
break;
}
}

void printArray(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}

int main() {
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);

cout << "Original array: ";
printArray(arr, n);

bubbleSort(arr, n);

cout << "Sorted array: ";
printArray(arr, n);

return 0;
}
OUTPUT :
Original array: 64 34 25 12 22 11 90
Sorted array: 11 12 22 25 34 64 90

9. Write a Program to implement Insertion Sort in C++

#include <iostream>
using namespace std;

void insertionSort(int arr[], int n) {
for (int i = 1; i < n; i++) {
int key = arr[i]; // Current element to be inserted
int j = i - 1;

// Shift elements of arr[0..i-1] that are greater than key
while (j >= 0 && arr[j] > key) {
arr[j + 1] = arr[j]; // Move element one position ahead
j--;
}

arr[j + 1] = key; // Insert key into the correct position
}
}

void printArray(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}

int main() {
int arr[] = {29, 10, 14, 37, 13};
int n = sizeof(arr)/sizeof(arr[0]);

cout << "Original array: ";
printArray(arr, n);

insertionSort(arr, n);

cout << "Sorted array: ";
printArray(arr, n);

return 0;
}

OUTPUT :
Original array: 29 10 14 37 13
Sorted array: 10 13 14 29 37

10. Write a Program to implement Selection Sort in C++

#include <iostream>
using namespace std;

void selectionSort(int arr[], int n) {
for (int i = 0; i < n - 1; i++) {
int minIndex = i;

// Find the minimum element in the remaining unsorted array
for (int j = i + 1; j < n; j++) {
if (arr[j] < arr[minIndex])
minIndex = j;
}

// Swap the found minimum with the first element of unsorted
part
if (minIndex != i)
swap(arr[i], arr[minIndex]);
}
}

void printArray(int arr[], int n) {
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << endl;
}

int main() {
int arr[] = {64, 25, 12, 22, 11};
int n = sizeof(arr) / sizeof(arr[0]);

cout << "Original array: ";
printArray(arr, n);

selectionSort(arr, n);

cout << "Sorted array: ";
printArray(arr, n);

return 0;
}

OUTPUT :
Original array: 64 25 12 22 11
Sorted array: 11 12 22 25 64

Mcgregor Assessment Plan
No ratings yet
Mcgregor Assessment Plan
19 pages
Creating A Personal Budget Assignment
100% (2)
Creating A Personal Budget Assignment
3 pages
Highway Material Testing Manual: Dr. PVSN Pavan Kumar Professor, Guru Nanak Institutions Technical Campus
No ratings yet
Highway Material Testing Manual: Dr. PVSN Pavan Kumar Professor, Guru Nanak Institutions Technical Campus
145 pages
Data Structure Lab Manual
No ratings yet
Data Structure Lab Manual
20 pages
daa-1
No ratings yet
daa-1
25 pages
AashishADS
No ratings yet
AashishADS
23 pages
adsa new
No ratings yet
adsa new
27 pages
ADSA Practical
No ratings yet
ADSA Practical
46 pages
ARYAN DAA Practical FILE PDF
No ratings yet
ARYAN DAA Practical FILE PDF
18 pages
Rauf Khann C M M File
No ratings yet
Rauf Khann C M M File
12 pages
Insertion
No ratings yet
Insertion
16 pages
Daa Practical File
No ratings yet
Daa Practical File
30 pages
AashishADS-2
No ratings yet
AashishADS-2
23 pages
Binary Search Tree With Tree Tranversal Techniques: EX - NO:9 Date
No ratings yet
Binary Search Tree With Tree Tranversal Techniques: EX - NO:9 Date
19 pages
Assignment Analysis Design of Algorithm Anshika Chauhan 0103CS191041
No ratings yet
Assignment Analysis Design of Algorithm Anshika Chauhan 0103CS191041
51 pages
Daa Final
No ratings yet
Daa Final
15 pages
DSA Assignment
No ratings yet
DSA Assignment
14 pages
Bubble
No ratings yet
Bubble
22 pages
EDITED-DAA file.
No ratings yet
EDITED-DAA file.
35 pages
Daa Assignments in Word
No ratings yet
Daa Assignments in Word
15 pages
Data Structure and Algorithm
No ratings yet
Data Structure and Algorithm
18 pages
Project
No ratings yet
Project
38 pages
Adt Lab
No ratings yet
Adt Lab
55 pages
C Prog
No ratings yet
C Prog
8 pages
Program 8) Design, Develop and Implement A Program in CPP For Sorting An Element From Data Given by The User, Using
No ratings yet
Program 8) Design, Develop and Implement A Program in CPP For Sorting An Element From Data Given by The User, Using
29 pages
Design and Analysis of Algorithms: Submitted By
No ratings yet
Design and Analysis of Algorithms: Submitted By
22 pages
DAA File Print
No ratings yet
DAA File Print
20 pages
Ass Gnment
No ratings yet
Ass Gnment
14 pages
DAA Lab File
No ratings yet
DAA Lab File
56 pages
Ada Lab File - Deepak Yadav
No ratings yet
Ada Lab File - Deepak Yadav
25 pages
Bubble Sort
No ratings yet
Bubble Sort
20 pages
DAA File
No ratings yet
DAA File
10 pages
Data structure practicle traning report
No ratings yet
Data structure practicle traning report
24 pages
ADA_FILE_sj (2)
No ratings yet
ADA_FILE_sj (2)
30 pages
Practical File On Data Structures Using C++: Submitted To: Submitted by
No ratings yet
Practical File On Data Structures Using C++: Submitted To: Submitted by
51 pages
Datastructure Practical File
No ratings yet
Datastructure Practical File
114 pages
Sarthak To Marda A File
No ratings yet
Sarthak To Marda A File
17 pages
Lab Solution Week 4 Recurrence Method
No ratings yet
Lab Solution Week 4 Recurrence Method
8 pages
LAB Manual C++ by Qasim Niaz
No ratings yet
LAB Manual C++ by Qasim Niaz
42 pages
DATASTRUCTURE LABmanual
No ratings yet
DATASTRUCTURE LABmanual
74 pages
Ada
No ratings yet
Ada
27 pages
Design and Analysis of Algorithms
No ratings yet
Design and Analysis of Algorithms
32 pages
Ex. No: 1 Date: Recursive Function For Tree Traversal and Fibonacci
No ratings yet
Ex. No: 1 Date: Recursive Function For Tree Traversal and Fibonacci
79 pages
CheetSheetCIS22AFinal
No ratings yet
CheetSheetCIS22AFinal
4 pages
Data Structures Lab Manual
No ratings yet
Data Structures Lab Manual
25 pages
Advance Algorithm Lab Record
No ratings yet
Advance Algorithm Lab Record
32 pages
Analysis Algo
No ratings yet
Analysis Algo
41 pages
DSA LAB PRINT
No ratings yet
DSA LAB PRINT
56 pages
ADA Lab Abhi
No ratings yet
ADA Lab Abhi
23 pages
all_of_3
No ratings yet
all_of_3
56 pages
sds
No ratings yet
sds
22 pages
Shivam Daa
No ratings yet
Shivam Daa
12 pages
Final File Dsa
No ratings yet
Final File Dsa
11 pages
ADA lab file ( Md Emat Haider )
No ratings yet
ADA lab file ( Md Emat Haider )
24 pages
Aoa Lab
No ratings yet
Aoa Lab
7 pages
Codes for a lot of things
No ratings yet
Codes for a lot of things
5 pages
Program and Output
No ratings yet
Program and Output
69 pages
Data Structure Lab Manual
No ratings yet
Data Structure Lab Manual
25 pages
Data Structure Assignment
No ratings yet
Data Structure Assignment
12 pages
DAA Gourav-1
No ratings yet
DAA Gourav-1
24 pages
LAB REPORT (1)
No ratings yet
LAB REPORT (1)
33 pages
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
150+ C Pattern Programs
From Everand
150+ C Pattern Programs
Hernando Abella
No ratings yet
50 Copies TQ Emath 122 Pre Lim Exam Balansag 1
No ratings yet
50 Copies TQ Emath 122 Pre Lim Exam Balansag 1
3 pages
Gaddis Java 5 Chapter 10 Quiz
100% (1)
Gaddis Java 5 Chapter 10 Quiz
10 pages
Maths Lit p2 QP Gr11 Nov2022 - English
No ratings yet
Maths Lit p2 QP Gr11 Nov2022 - English
11 pages
Dineshkumar Vidi Ravindran: Professional Summary
No ratings yet
Dineshkumar Vidi Ravindran: Professional Summary
4 pages
Constellations:: Mythology & Science
No ratings yet
Constellations:: Mythology & Science
36 pages
18305-CMLC-RDMP Public Engagement Report-Optimized v1.1
No ratings yet
18305-CMLC-RDMP Public Engagement Report-Optimized v1.1
89 pages
MD1-0-T-030-05-00073 - ITP For Under Ground Piping PDF
No ratings yet
MD1-0-T-030-05-00073 - ITP For Under Ground Piping PDF
8 pages
06-Adversarial_Search
No ratings yet
06-Adversarial_Search
72 pages
Correlating Melt Rheology of PET To Solution Intrinsic Viscosity
No ratings yet
Correlating Melt Rheology of PET To Solution Intrinsic Viscosity
2 pages
Cplast 114: Technical Data Sheet
No ratings yet
Cplast 114: Technical Data Sheet
2 pages
How Does J.B. Priestley Express His Views On Social Resonsibility in An Inspector Calls
40% (5)
How Does J.B. Priestley Express His Views On Social Resonsibility in An Inspector Calls
5 pages
ME 251 Laboratory Exercises: Mechanical Engineering, Indian Institute of Technology Kanpur Anupam Saxena
No ratings yet
ME 251 Laboratory Exercises: Mechanical Engineering, Indian Institute of Technology Kanpur Anupam Saxena
17 pages
Techno Module Brochure
No ratings yet
Techno Module Brochure
28 pages
Union Cross Business Park
No ratings yet
Union Cross Business Park
4 pages
Mathematics QM016 Topic 1: Number System - Tutorial
No ratings yet
Mathematics QM016 Topic 1: Number System - Tutorial
4 pages
Huawei Certification Examination Appointment Guide
No ratings yet
Huawei Certification Examination Appointment Guide
14 pages
Teoría Atómica Moderna
No ratings yet
Teoría Atómica Moderna
140 pages
School Form 2 (SF2) Daily Attendance Report of Learners
No ratings yet
School Form 2 (SF2) Daily Attendance Report of Learners
2 pages
Measuring Suicidal Behavior and Risk in Children and Adolescents 1st Edition David B. Goldston - Download the ebook now for an unlimited reading experience
100% (1)
Measuring Suicidal Behavior and Risk in Children and Adolescents 1st Edition David B. Goldston - Download the ebook now for an unlimited reading experience
53 pages
Sumanto - [email protected]: Not Including Amine Drain Pump (Self Priming Type) Not Including Antifoam Injection Pump
No ratings yet
Sumanto - [email protected]: Not Including Amine Drain Pump (Self Priming Type) Not Including Antifoam Injection Pump
3 pages
Timber Design - Introduction
No ratings yet
Timber Design - Introduction
25 pages
Thesis About Prison System
100% (1)
Thesis About Prison System
8 pages
Literary Analysis: How To Write It?
No ratings yet
Literary Analysis: How To Write It?
27 pages
INKA - Trend of Rolling Stock Technology
No ratings yet
INKA - Trend of Rolling Stock Technology
15 pages
Force and Laws of Motion Worksheet-6 Class 9
No ratings yet
Force and Laws of Motion Worksheet-6 Class 9
16 pages
Spec กฟภ.กจพ.1-ป (มต) -001-2565 f
No ratings yet
Spec กฟภ.กจพ.1-ป (มต) -001-2565 f
96 pages
Edu 250 Lesson Plan 2
No ratings yet
Edu 250 Lesson Plan 2
4 pages

CORE - 14 - Algorithm Design Techiniques

Uploaded by

CORE - 14 - Algorithm Design Techiniques

Uploaded by

1.

Write a Linear Search Algorithm in C++

Enter the number to search: 8​

Enter the number to search: 10​

3.Write a Merge Sort Algorithm in C++

4. Write a Quick Sort Algorithm in C++

5. Write a Heap Sort Algorithm in C++

6. Write a Program to implement BFS in C++

BFS Traversal starting from node 0: 0 1 2 3 4 5

7. Write a Program to implement DFS in C++

9. Write a Program to implement Insertion Sort in C++

10. Write a Program to implement Selection Sort in C++

You might also like

Enter the number to search: 8

Enter the number to search: 10