Heap sort in python

AffirmationsInPython.py

@@ -0,0 +1,77 @@
+# -*- coding: utf-8 -*-
+"""
+Created on Tue Oct  4 15:32:00 2022
+
+@author: aarus
+"""
+
+# Import turtle package
+import turtle
+
+# Creating a turtle object(pen)
+pen = turtle.Turtle()
+
+# Defining a method to draw curve
+def curve():
+    for i in range(200):
+
+        # Defining step by step curve motion
+        pen.right(1)
+        pen.forward(1)
+
+# Defining method to draw a full heart
+def heart():
+
+    # Set the fill color to red
+    pen.fillcolor('red')
+
+    # Start filling the color
+    pen.begin_fill()
+
+    # Draw the left line
+    pen.left(140)
+    pen.forward(113)
+
+    # Draw the left curve
+    curve()
+    pen.left(120)
+
+    # Draw the right curve
+    curve()
+
+    # Draw the right line
+    pen.forward(112)
+
+    # Ending the filling of the color
+    pen.end_fill()
+
+# Defining method to write text
+def txt():
+
+    # Move turtle to air
+    pen.up()
+
+    # Move turtle to a given position
+    pen.setpos(-68, 95)
+
+    # Move the turtle to the ground
+    pen.down()
+
+    # Set the text color to lightgreen
+    pen.color('black')
+
+    # Write the specified text in 
+    # specified font style and size
+    pen.write("YOU MATTER!!", font=(
+      "Andada Pro", 15, "bold"))
+
+
+
+# Draw a heart
+heart()
+
+# Write text
+txt()
+
+# To hide turtle
+pen.ht()

AlternateSwap.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+using namespace std;
+
+void swapAlternate(int arr[], int size)
+{
+    for (int i = 0; i < size; i += 2)
+    {
+        if (i + 1 < size)
+        {
+            swap(arr[i], arr[i + 1]);
+        }
+    }
+}
+
+void printArray(int arr[], int n)
+{
+    for (int i = 0; i < n; i++)
+    {
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+}
+
+int main()
+{
+    int arr[8] = {1, 3, 5, 7, 9, 2, 6, 0};
+    int brr[5] = {1, 3, 5, 7, 9};
+
+    swapAlternate(arr, 8);
+    printArray(arr, 8);
+
+    swapAlternate(brr, 5);
+    printArray(brr, 5);
+    return 0;
+}

BellmanFord.cpp

@@ -0,0 +1,56 @@
+#include "bits/stdc++.h"
+using namespace std;
+
+const int INF = 1e9;
+
+int main(){
+    int n,m;cin>>n>>m;
+    vector<vector<int>> edges;
+    cout<<"u v w"<<endl;
+    for (int i = 0; i < m; i++)
+    {
+        int u,v,w;
+        cin>>u>>v>>w;
+        edges.push_back({u,v,w});
+    }
+    cout<<endl;
+    cout<<"SOURCE : "<<endl;
+    int src; cin>>src;
+    vector<int> dist(n,INF);
+    dist[src] = 0;
+    for (int iter = 0; iter < n-1; iter++)
+    {
+        bool change = false;
+
+        for(auto e : edges){
+            int u = e[0];
+            int v = e[1];
+            int w = e[2];
+
+            //for detection of cycle
+            if(dist[v] > w + dist[u]){
+                change = true;
+            }
+            dist[v] = min(dist[v], w + dist[u]);
+        }
+    }
+    cout<<"VERTEX     DISTANCE FROM SOURCE"<<endl;
+    for(int i=0;i<n;i++){
+        cout<<i<<"              "<<dist[i]<<endl;
+    }
+    cout<<endl;
+
+    return 0;
+}
+
+// 5 8   
+// 1 2 3
+// 3 2 5
+// 1 3 2
+// 3 1 1
+// 1 4 2
+// 0 2 4
+// 4 3 -3
+// 0 1 -1
+// 0
+// 0 -1 2 -2 1 

BinToDec.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+#include <math.h>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    int ans=0; 
+    int i=0;
+    while(n!=0)
+    {
+        int bit = n%10;
+        n/=10;
+        ans = (bit * pow(2,i)) + ans;
+        i++;
+    }
+    cout<< "Answer is " << ans <<endl;
+}

Binary Search

@@ -0,0 +1,31 @@
+//code for binnary search algorithim in C
+
+#include <stdio.h>
+
+int binarySearch(int arr[], int l, int r, int x)
+{
+	if (r >= l) {
+		int mid = l + (r - l) / 2;
+
+		if (arr[mid] == x)
+			return mid;
+
+		if (arr[mid] > x)
+			return binarySearch(arr, l, mid - 1, x);
+
+		return binarySearch(arr, mid + 1, r, x);
+	}
+	return -1;
+}
+
+int main(void)
+{
+	int arr[] = { 2, 3, 4, 10, 40 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+	int x = 10;
+	int result = binarySearch(arr, 0, n - 1, x);
+	(result == -1)
+		? printf("Element is not present in array")
+		: printf("Element is present at index %d", result);
+	return 0;
+}

BreadthFirstSearch.c

@@ -0,0 +1,37 @@
+#include <stdio.h>
+void BFS(int a[10][10], int n, int src, int s[10])
+{
+    int f = 0, r = -1, q[20], i, v;
+    printf("Source Node: %d\n", src);
+    s[src] = 1;
+    q[++r] = src;
+    printf("Visited Nodes using BFS:\n");
+    while (f <= r)
+    {
+        v = q[f++];
+        for (i = 1; i <= n; i++)
+            if (s[i] == 0 && a[v][i])
+            {
+                q[++r] = i;
+                printf("%d\t", i);
+                s[i] = 1;
+            }
+    }
+}
+int main()
+{
+    int a[10][10], n, i, j, s[20], src;
+    printf("Enter no. of Nodes in Graph\n");
+    scanf("%d", &n);
+    printf("Enter the connections of Graph in Adjacency Matrix\n");
+    for (i = 1; i <= n; i++)
+        for (j = 1; j <= n; j++)
+            scanf("%d", &a[i][j]);
+    printf("Enter the Source Node\n");
+    scanf("%d", &src);
+    for (i = 1; i <= n; i++)
+        s[i] = 0;
+    BFS(a, n, src, s);
+    printf("\n");
+    return 0;
+}

BubbleSort_OptimisedCode.cpp

@@ -0,0 +1,63 @@
+// Optimized implementation of Bubble sort to avoid extra spaces.
+
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+
+
+void bubbleSort(int arr[], int n)
+{
+    int i, j, flag, temp;
+
+   for (i = 0; i < n-1; i++)
+  {
+	flag=0;
+	for (j = 0; j < n-1-i; j++)
+	{
+		if (arr[j] > arr[j+1])
+		{
+		   temp=arr[j];
+		   arr[j]=arr[j+1];
+		   arr[j+1]=temp;
+		   flag=1;
+		}
+	}
+
+	// IF no two elements were swapped
+	// by inner loop, then break
+	if (flag==0)
+		break;
+  }
+}
+
+// Function to print an array
+void printArray(int arr[], int size)
+{
+	    for (int i = 0; i < size; i++)
+            {
+		cout <<" "<< arr[i];
+            }
+}
+
+// Driver program to test above functions
+int main()
+{
+        int n;// size of the array
+	cout<<"Enter the size of Array"<<endl;
+	cin>>n;
+
+	int arr[n];
+	cout<<"Enter the elements of the Array"<<endl;
+	for(int i=0; i<n; i++)
+	{
+	    cin>>arr[i];
+	}
+
+	bubbleSort(arr, n);
+	cout <<"Sorted array: \n";
+	printArray(arr, n);
+	return 0;
+}
+// Time Complexity:
+// Best Case: O(n)
+// Worst case: O(n^2)

CONTRIBUTING.md

@@ -1,2 +1,5 @@
 A repo for beginner contributors in hacktober 2022 , you can create a file and upload a new program and pull. MAke sure the program is error free. Multiple languages allowed .
 Happy coding.
+
+
+[Abhishek Kevin Gomes.txt](https://github.com/Anurag2622002/Codefornewccoder/files/9703528/Abhishek.Kevin.Gomes.txt)