HACKTOBERFEST-2022

0-1pattern.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin>>n;
+
+    for(int i=1;i<=n;i++){
+        for(int j=1;j<=i;j++){
+            if((i+j)%2==0){
+                cout<<" 1";
+            }
+            else{
+                cout<<" 0";
+            }
+        }
+        cout<<endl;
+    }
+
+    return 0;
+}

00.Introduction/Details.java

@@ -0,0 +1,19 @@
+import java.util.Scanner;
+
+class Details {
+    public static void main(String args[])
+    {
+       System.out.println("Enter the required details: ");
+       Scanner dtl=new Scanner(System.in);
+       System.out.println("Enter your name: ");
+       String name=dtl.nextLine();
+       System.out.println("Enter your Mobile number: ");
+      Long phone=dtl.nextLong();
+       System.out.println("Enter your age: ");
+       int age=dtl.nextInt();
+       System.out.println("    WELCOME    ");
+       System.out.println("   Nice to meet you "+ name);
+       System.out.println("  Thank You for filling the details.    ");
+       System.out.println(" We'll surely contact you on "+ phone + " for further details.    ");
+    }
+}

00.Introduction/First.java

@@ -0,0 +1,9 @@
+class First
+{
+    public static void main(String args[])
+    {
+        System.out.println("Hello World");
+        // System.out.println(args[0]);
+        // System.out.println(args[1]);
+    }
+}

1.PreOrder - Using Stack.txt

@@ -0,0 +1,69 @@
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
+ *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
+ * };
+ */
+class Solution {
+public:
+    void preorder(TreeNode* root,vector<int> &ans)
+    {
+        if(root==NULL)
+        {
+            return;
+        }
+        else
+        {
+             ans.push_back(root->val);
+            preorder(root->left,ans);
+            preorder(root->right,ans);
+        }
+    }
+public:
+    vector<int> preorderTraversal(TreeNode* root) {
+        vector<int> ans;
+        preorder(root,ans);
+        return ans;
+    }
+};
+
+
+
+
+Using stack
+
+class Solution {
+public:
+    vector<int> preorderTraversal(TreeNode* root) {
+        vector<int> ans;
+        if(root==NULL)
+        {
+            return ans;
+        }
+        else
+        {
+            stack<TreeNode*> st;
+            st.push(root);
+            while(!st.empty())
+            {
+                TreeNode* node = st.top();
+                st.pop();
+                 if(node->right!=NULL)
+                {
+                    st.push(node->right);
+                }
+                if(node->left!=NULL)
+                {
+                    st.push(node->left);
+                }
+               ans.push_back(node->val);
+            }
+            return ans;
+        }
+    }
+};

1.cpp

@@ -0,0 +1,210 @@
+//
+//  dsatrial1.cpp
+//
+//
+//  Created by Vansh Vatsal on 30/08/22.
+//
+
+#include <bits/stdc++.h>
+using namespace std;
+
+class SEIT
+{
+    string name;
+    int roll;
+    float sgpa;
+
+public:
+    void getdata()
+    {
+        string a;
+        int b;
+        float c;
+        cout << "Enter Name : " << endl;
+        cin >> a;
+        cout << "Enter Roll No. : " << endl;
+        cin >> b;
+        cout << "Enter SGPA : " << endl;
+        cin >> c;
+        name = a;
+        roll = b;
+        sgpa = c;
+    }
+    void putdata()
+    {
+        cout << name << endl;
+        cout << roll << endl;
+        cout << sgpa << endl;
+    }
+    void linearsearch(SEIT s[], int n, float key)
+    {
+        bool flag = 1;
+        for (int i = 0; i < n; i++)
+        {
+            if (s[i].sgpa == key)
+            {
+                cout << "Object is present at " << i << " index." << endl;
+                s[i].putdata();
+                flag = 0;
+            }
+        }
+        if (flag)
+        {
+            cout << "No record found" << endl;
+        }
+    }
+
+    void binarysearch(SEIT s[], int n, string nm)
+    {
+
+        int start = 0;
+        int end = n - 1;
+        int mid = (start + end) / 2;
+        bool flag = 1;
+        while (start <= end)
+        {
+            if (s[mid].name == nm)
+            {
+                s[mid].putdata();
+                flag = 0;
+                break;
+            }
+            else if (s[mid].name < nm)
+            {
+                start = mid + 1;
+            }
+            else
+            {
+                end = mid - 1;
+            }
+            mid = (start + end) / 2;
+        }
+        if (flag)
+        {
+            cout << "No record found." << endl;
+        }
+    }
+    void bubblesort(SEIT s[], int n)
+    {
+
+        for (int l = 0; l < n; ++l)
+        {
+
+            for (int i = 0; i < n -l-1; ++i)
+            {
+
+                if ( s[i].roll > s[i+1].roll)
+                {
+                    swap(s[i],s[i+1]);
+                }
+            }
+        }
+    }
+    void insertionSort( SEIT s[], int size) {
+  for (int step = 1; step < size; step++) {
+    int key = s[step];
+    int j = step - 1;
+
+    // Compare key with each element on the left of it until an element smaller than
+    // it is found.
+    // For descending order, change key<array[j] to key>array[j].
+    while (key < s[j] && j >= 0) {
+      s[j + 1] = s[j];
+      --j;
+    }
+    s[j + 1] = key;
+  }
+}
+    void printArray(SEIT s[], int n)
+    {
+        for (int i = 0; i < n; ++i)
+        {
+            cout << "roll  " <<  s[i].roll<<endl;
+            cout << "name  " << s[i].name<<endl;
+            cout << "sgpa  " << s[i].sgpa<<endl;
+        }
+        cout << "\n";
+    }
+};
+
+int
+menu()
+{
+    int a;
+    cout << " 1 for linear search" << endl;
+    cout << " 2 for binary search" << endl;
+    cout << " 3 to display details of all students" << endl;
+    cout << " 4 to exit" << endl;
+    cout << " 5 to do Bubble Sort" << endl;
+    cout << " 6 to do Insertion Sort" << endl;
+
+    cout << "enter your choice = ";
+    cin >> a;
+    cout << endl;
+    return a;
+}
+int main()
+{
+    cout << "enter number of students" << endl;
+    int n;
+    cin >> n;
+    SEIT s[n];
+    for (int i = 0; i < n; i++)
+    {
+        s[i].getdata();
+    }
+    int status;
+    status = menu();
+    while (true)
+    {
+        SEIT task;
+
+        if (status == 4)
+        {
+            break;
+        }
+        else if (status == 1)
+        {
+            float key;
+            cout << "Enter SGPA of the student : " << endl;
+            cin >> key;
+
+            task.linearsearch(s, n, key);
+        }
+        else if (status == 2)
+        {
+            string nm;
+            cout << "Enter the name of the student : " << endl;
+            cin >> nm;
+            task.binarysearch(s, n, nm);
+        }
+        else if (status == 3)
+        {
+            for (int i = 0; i < n; i++)
+            {
+                s[i].getdata();
+            }
+        }
+        else if (status == 5)
+        {
+
+            task.bubblesort(s, n);
+            cout << "Sorted Array in Ascending Order:\n";
+            task.printArray(s,n);
+
+        }
+        else if (status==6){
+            task.insertionSort(s,size);
+            cout<<"Insertion Sort"<<endl;
+            task.printArray(s,size);
+        }
+
+        else
+        {
+            cout << "invalid input pls enter another choice" << endl;
+        }
+
+        status = menu();
+    }
+    return 0;
+}