feat: added basic code structure for some languages (#4)

* feat: added basic code structure for python

* feat : added some more languages with base structure

* feat: better naming conventions, fixing bugs

* feat: generic messages

* fix: naming

Co-authored-by: Alok Naushad <[email protected]>

Author: axrav

.gitignore

@@ -0,0 +1 @@
+.vscode

C++/binarysearch.cpp

@@ -0,0 +1,20 @@
+// Binary Search Algorithm in C++
+
+#include <iostream>
+
+using namespace std;
+
+int BinarySearch(int *arr, int size, int x)
+{
+    // your code goes here
+    // return the index of x in arr if found otherwise return -1
+}
+
+int main()
+{
+    int arr[5] = {2, 3, 4, 10, 40};
+    int x = 10;
+    int z = BinarySearch(arr, 5, x);
+    cout << z;
+    return 0;
+}

C++/binarytree.cpp

@@ -0,0 +1,36 @@
+// Binary Tree Algorithm in C++
+
+#include <iostream>
+
+using namespace std;
+
+struct Node
+{
+    int data;
+    Node *left;
+    Node *right;
+};
+
+Node *NewNode(int data)
+{
+    // your code goes here
+}
+
+Node *Insert(Node *node, int data)
+{
+    // your code goes here
+}
+
+Node *PrintTree(Node *node)
+{
+    // your code goes here
+}
+
+int main()
+{
+    Node *root = NewNode(100);
+    Insert(root, 50);
+    Insert(root, 150);
+    Insert(root, 25);
+    PrintTree(root);
+}

C++/bubblesort.cpp

@@ -0,0 +1,22 @@
+// Bubble Sort Algorithm in C++
+
+#include <iostream>
+
+using namespace std;
+
+void BubbleSort(int *arr, int size)
+{
+    // your code goes here
+    // print the sorted array
+}
+
+int main()
+{
+    int arr[6] = {76, 22, 21, 96, 70, 20};
+    BubbleSort(arr, 6);
+    return 0;
+}
+
+// Output
+
+// 21 22 20 70 76 96

C++/checkPrime.cpp

@@ -0,0 +1,21 @@
+// Check Prime Number in C++
+
+#include <iostream>
+
+using namespace std;
+bool IsPrime(int n)
+{
+    // your code goes here
+    // check if the number is prime or not and return true or false accordingly
+}
+
+int main()
+{
+    int n = 73;
+    bool result = IsPrime(n);
+    cout << result;
+    return 0;
+}
+
+// Output
+// 73 is a prime number

C++/eval.cpp

@@ -0,0 +1,18 @@
+// Eval Function for C++
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main()
+{
+    string expression = "10 + 20 * 30";
+    cout << eval(expression) << endl;
+}
+
+int eval(string expression)
+{
+    // your code goes here
+}
+
+// Output
+// 610

C++/fibonacci.cpp

@@ -0,0 +1,19 @@
+// Fibonacci Series in C++
+
+#include <iostream>
+
+using namespace std;
+int fib(int n)
+{
+    // your code goes here
+    // print the fibonacci series
+}
+
+int main()
+{
+    fib(10);
+}
+
+// Output
+
+// 0 1 1 2 3 5 8 13 21 34

C++/heapsort.cpp

@@ -0,0 +1,27 @@
+// Heap Sort Algorithm in C++
+
+#include <iostream>
+
+using namespace std;
+
+void Heapify(int *arr, int size, int i)
+{
+    // your code goes here
+}
+
+void HeapSort(int *arr, int size)
+{
+    // your code goes here
+    // print the sorted array
+}
+
+int main()
+{
+    int arr[6] = {76, 22, 21, 96, 70, 20};
+    HeapSort(arr, 6);
+    return 0;
+}
+
+// Output
+
+// 20 21 22 70 76 96

C++/helloworld.cpp

@@ -0,0 +1,10 @@
+// Hello world in C++
+
+#include <iostream>
+
+using namespace std;
+int main()
+{
+    cout << "Hello World";
+    return 0;
+}

C++/infixtopostfix.cpp

@@ -0,0 +1,20 @@
+// Infix to Postfix Conversion using Stack in C++
+
+#include <iostream>
+
+using namespace std;
+
+string InfixToPostfix(string expression)
+{
+    // your code goes here
+    // return the postfix expression
+}
+
+int main()
+{
+    string expression = "a+b*(c^d-e)^(f+g*h)-i";
+    cout << InfixToPostfix(expression) << endl;
+}
+
+// Output
+// abcd^e-fgh*+^*+i-

C++/linearsearch.cpp

@@ -0,0 +1,24 @@
+// Linear Search Algorithm in C++
+
+#include <iostream>
+
+using namespace std;
+int LinearSearch(int *arr, int size, int x)
+{
+    for (int i = 0; i < size; i++)
+    {
+        if (arr[i] == x)
+        {
+            return i;
+        }
+    }
+    return -1;
+}
+
+int main()
+{
+    int arr[5] = {2, 3, 4, 10, 40};
+    int x = 10;
+    int z = LinearSearch(arr, 5, x);
+    cout << z;
+}

C++/selectionsort.cpp

@@ -0,0 +1,22 @@
+// Selection Sort Algorithm in C++
+
+#include <iostream>
+
+using namespace std;
+
+void SelectionSort(int *arr, int size)
+{
+    // your code goes here
+    // print the sorted array
+}
+
+int main()
+{
+    int arr[6] = {76, 22, 21, 96, 70, 20};
+    SelectionSort(arr, 6);
+    return 0;
+}
+
+// Output
+
+// 20 21 22 70 76 96

C/binarysearch.c

@@ -0,0 +1,22 @@
+// Binary Search Algorithm in C++
+
+#include <stdio.h>
+
+int BinarySearch(int *arr, int size, int x)
+{
+    // your code goes here
+    // return the index of the element if found else return -1
+}
+
+int main()
+{
+    int arr[5] = {2, 3, 4, 10, 40};
+    int x = 10;
+    int index = BinarySearch(arr, 5, x);
+    printf("%d", index);
+    return 0;
+}
+
+// Output
+
+// 3

C/binarytree.c

@@ -0,0 +1,36 @@
+// Binary Tree Implementation in C
+
+#include <stdio.h>
+
+struct node
+{
+    int data;
+    struct node *left;
+    struct node *right;
+};
+
+struct node *NewNode(int data)
+{
+    // your code goes here
+}
+
+void PrintTree(struct node *root)
+{
+    // your code goes here
+}
+
+void Insert(struct node *root, int data)
+{
+    // your code goes here
+}
+
+int main()
+{
+    struct node *root = NewNode(100);
+    Insert(root, 50);
+    Insert(root, 200);
+    Insert(root, 25);
+
+    PrintTree(root);
+    return 0;
+}

C/bubblesort.c

@@ -0,0 +1,19 @@
+// Bubble sort algorithm in C
+
+#include <stdio.h>
+
+void bubbleSort(int arr[], int n)
+{
+    // your code goes here
+    // print the sorted array
+}
+
+int main()
+{
+    int arr[6] = {76, 22, 21, 96, 70, 20};
+    bubbleSort(arr, 6);
+    return 0;
+}
+
+// Output
+// 20 21 22 70 76 96

C/checkprime.c

@@ -0,0 +1,18 @@
+// Check if a number is prime or not in C.
+
+#include <stdio.h>
+
+int IsPrime(int n)
+{
+    // your code goes here
+    // return 1 if n is prime else return 0
+}
+int main()
+{
+    int n = 73;
+    int result = IsPrime(n);
+    printf("%d", result);
+}
+
+// Output
+// 73

C/eval.c

@@ -0,0 +1,19 @@
+// Eval function for C
+
+#include <stdio.h>
+
+int evaluate(char *expression)
+{
+    // your code goes here
+}
+
+int main()
+{
+    char expr[100] = "10 + 20 * 30";
+    int result = 0;
+    result = evaluate(expr);
+    printf("Result: %d", result);
+}
+
+// Output
+// 610