Merge branch 'master' into DoubleLinkedListC

Author: Monik09

breadth_first_search/BreadthFirstSearch.cpp

@@ -0,0 +1,69 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+vector<int> BreadthFirstSearch(int vertex,vector<int> adjacent[],int start_vertex,int destination){
+	queue<int> que;
+    //bfsPath will store the path
+	vector<int> bfsPath;
+    //this array will take care of duplicate traversing
+	bool visited[vertex];
+    vector<int>::iterator it;
+	que.push(start_vertex);
+    bfsPath.push_back(start_vertex);
+	visited[start_vertex]=true;
+    int flag=0;
+	while(!que.empty()){
+		int tem = que.front();
+		que.pop();
+		for(it = adjacent[tem].begin();it<adjacent[tem].end();it++){
+            if(!visited[*it]){
+                bfsPath.push_back(*it);
+                //if destination is found
+                if(*it==destination){
+                    flag=1;
+                    break;
+                }
+                visited[*it] = true;
+                que.push(*it);
+            }
+        }
+        if(flag==1){
+            break;
+        }
+	}
+    //if we will not find the destination
+    if(flag==0){
+        bfsPath.clear();
+    }
+    return bfsPath;
+}
+
+//this fn will print the path
+void printTraversal(vector<int>bfsPath){
+    vector<int>::iterator it;
+    for(it = bfsPath.begin();it<bfsPath.end();it++){
+        cout<<*it<<endl;
+    }
+}
+
+int main() {
+    //number of vertex
+	int vertex = 4;
+	vector<int> adjacent[vertex];
+	adjacent[0].push_back(1);
+	adjacent[0].push_back(3);
+	adjacent[1].push_back(2);
+	adjacent[2].push_back(3);
+    //starting vertex
+	int start_vertex = 0;
+    //destination
+    int destination = 3;
+	vector<int> bfsPath = BreadthFirstSearch(vertex,adjacent,start_vertex,destination);
+    if(!bfsPath.empty()){
+    printTraversal(bfsPath);
+    }else{
+        cout<<"path not found";
+    }
+    return 0;
+}
+

fibonacci_number/FibonacciNumber.c

@@ -0,0 +1,43 @@
+#include <stdio.h>
+
+long long int FibonacciNumber(long long int n)
+{
+	//Because first fibonacci number is 0 and second fibonacci number is 1.
+	if (n == 1 || n == 2)
+	{
+		return (n - 1);
+	}
+	else
+	{
+		//store last fibonacci number
+		long long int a = 1;
+		//store second last fibonacci number
+		long long int b = 0;
+		//store current fibonacci number
+		long long int nth_Fib;
+		for (long long int i = 3; i <= n; i++)
+		{
+			nth_Fib = a + b;
+			b = a;
+			a = nth_Fib;
+		}
+		return nth_Fib;
+	}
+}
+
+int main()
+{
+	long long int n;
+	printf("Enter a Number : ");
+	scanf("%lli", &n);
+	if (n < 1)
+	{
+		printf("Number must be greater than 0");
+	}
+	else
+	{
+		long long int nth_Fib = FibonacciNumber(n);
+		printf("Fibonacci Number is %lli", nth_Fib);
+	}
+	return 0;
+}

heap_sort/heapsort.cpp

@@ -0,0 +1,58 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+void swap(int array[], int index1, int index2) //swapping function wihout using third variable
+{
+	array[index1] = array[index1] + array[index2];
+	array[index2] = array[index1] - array[index2];
+	array[index1] = array[index1] - array[index2];
+}
+void heapify(int array[], int size, int index)
+{
+	int largest = index; //considering largest as root
+	int left = 2 * index + 1;
+	int right = 2 * index + 2;
+
+	if (left < size && array[left] > array[largest]) //left child is larger then root
+		largest = left;
+
+	if (right < size && array[right] > array[largest]) //right child is larger then root
+		largest = right;
+
+	if (largest != index) //condition if largest is not root
+	{
+		swap(array, index, largest);
+		heapify(array, size, largest);
+	}
+}
+void heapsort(int array[], int size)
+{
+
+	for (int i = size / 2 - 1; i >= 0; i--) //Create heap from array rearrangement
+		heapify(array, size, i);
+
+	for (int i = size - 1; i > 0; i--) //move current root to end a step for Extract min process
+	{
+
+		swap(array, 0, i); //swap element
+
+		heapify(array, i, 0); //excecuting heapify to bring all elements in correct position again
+	}
+}
+void display(int array[], int size)
+{
+	int i = 0;
+	for (i = 0; i < size; i++)
+		cout << array[i] << " ";
+	cout << endl;
+}
+int main()
+{
+	int array[] = {6, 3, 6, 343, 42, 1, 43, 35, 34, 43};
+	int size = sizeof(array) / sizeof(array[0]);
+	cout << "Unsorted array is :" << endl;
+	display(array, size); //display the unsorted array
+	heapsort(array, size);
+	cout << "sorted array is :" << endl;
+	display(array, size); //display the sorted array
+}