dancealgorithm 0.1.0__py3-none-any.whl

dancealgorithm/assignments/MS - Commerce/__init__.py

@@ -0,0 +1,34 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "MS - Commerce"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")

dancealgorithm/assignments/MS - Commerce/dataset.csv

@@ -0,0 +1,16 @@
+tx_id,customer_name,amount,timestamp
+TXN-501,Rajesh Kumar,1299,2024-02-10 09:12:00
+TXN-502,Sunita Menon,4599,2024-02-04 14:35:00
+TXN-503,Deepak Chopra,899,2024-02-15 11:20:00
+TXN-504,Kavita Sen,3450,2024-02-01 16:50:00
+TXN-505,Arjun Das,6200,2024-02-12 18:05:00
+TXN-506,Meera Pillai,2100,2024-02-08 10:40:00
+TXN-507,Suresh Raina,5400,2024-02-14 13:15:00
+TXN-508,Anita Roy,1850,2024-02-06 17:25:00
+TXN-509,Gaurav Bhatt,7300,2024-02-11 12:30:00
+TXN-510,Poonam Yadav,2990,2024-02-03 08:55:00
+TXN-511,Nikhil Bansal,4120,2024-02-13 15:45:00
+TXN-512,Shweta Tiwari,9800,2024-02-02 19:10:00
+TXN-513,Harish Rawat,1650,2024-02-09 11:05:00
+TXN-514,Preeti Jain,5100,2024-02-07 14:15:00
+TXN-515,Varun Kapoor,3750,2024-02-05 16:30:00

dancealgorithm/assignments/MS - Customer/Solution.java

@@ -0,0 +1,144 @@
+
+import java.util.*;
+import java.io.*;
+
+public class Solution {
+    // 1. Main Function
+
+    public static void main(String A[]) {
+        Scanner sobj = new Scanner(System.in);
+
+        int iSize = 0;
+
+        // 5. Read Dataset and Store Records
+
+        try {
+            Scanner fobj = new Scanner(new File("dataset.csv"));
+
+            fobj.nextLine(); // Skip header row
+
+            while (fobj.hasNextLine()) {
+                fobj.nextLine();
+                iSize++;
+            }
+
+            fobj.close();
+
+            CustomerOrder Arr[] = new CustomerOrder[iSize];
+
+            fobj = new Scanner(new File("dataset.csv"));
+
+            fobj.nextLine(); // Skip header row
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                String sLine = fobj.nextLine();
+                String sData[] = sLine.split(",");
+
+                String sID = sData[0].trim().replace("\"", "");
+                String sName = sData[1].trim().replace("\"", "");
+                String sAmount = sData[2].trim().replace("\"", "");
+                String sTimestamp = sData[3].trim().replace("\"", "");
+
+                Arr[iCnt] = new CustomerOrder(sID, sName, sAmount, sTimestamp);
+            }
+
+            fobj.close();
+
+            // 6. Call Merge Sort
+
+            MergeSort(Arr, 0, iSize - 1);
+
+            // 7. Display Sorted Records
+
+            System.out.println("\nOrders Sorted by Timestamp:");
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                System.out.println(Arr[iCnt].sOrderID + "  " +
+                        Arr[iCnt].sCustomerName + "  " +
+                        Arr[iCnt].sAmount + "  " +
+                        Arr[iCnt].sTimestamp);
+            }
+        } catch (Exception e) {
+            System.out.println("Error: " + e.getMessage());
+        }
+
+        sobj.close();
+    }
+
+    // 2. Customer Order Entity
+
+    static class CustomerOrder {
+        String sOrderID;
+        String sCustomerName;
+        String sAmount;
+        String sTimestamp;
+
+        CustomerOrder(String sOrderID, String sCustomerName,
+                String sAmount, String sTimestamp) {
+            this.sOrderID = sOrderID;
+            this.sCustomerName = sCustomerName;
+            this.sAmount = sAmount;
+            this.sTimestamp = sTimestamp;
+        }
+    }
+
+    // 3. Merge Function
+
+    public static void Merge(CustomerOrder Arr[], int iStart, int iMid, int iEnd) {
+        int iSize1 = iMid - iStart + 1;
+        int iSize2 = iEnd - iMid;
+
+        CustomerOrder LeftArr[] = new CustomerOrder[iSize1];
+        CustomerOrder RightArr[] = new CustomerOrder[iSize2];
+
+        for (int iCnt = 0; iCnt < iSize1; iCnt++) {
+            LeftArr[iCnt] = Arr[iStart + iCnt];
+        }
+
+        for (int iCnt = 0; iCnt < iSize2; iCnt++) {
+            RightArr[iCnt] = Arr[iMid + 1 + iCnt];
+        }
+
+        int i = 0;
+        int j = 0;
+        int k = iStart;
+
+        while (i < iSize1 && j < iSize2) {
+            if (LeftArr[i].sTimestamp.compareTo(RightArr[j].sTimestamp) <= 0) {
+                Arr[k] = LeftArr[i];
+                i++;
+            } else {
+                Arr[k] = RightArr[j];
+                j++;
+            }
+
+            k++;
+        }
+
+        while (i < iSize1) {
+            Arr[k] = LeftArr[i];
+            i++;
+            k++;
+        }
+
+        while (j < iSize2) {
+            Arr[k] = RightArr[j];
+            j++;
+            k++;
+        }
+    }
+
+    // 4. Merge Sort Function
+
+    public static void MergeSort(CustomerOrder Arr[], int iStart, int iEnd) {
+        if (iStart < iEnd) {
+            int iMid = (iStart + iEnd) / 2;
+
+            MergeSort(Arr, iStart, iMid);
+
+            MergeSort(Arr, iMid + 1, iEnd);
+
+            Merge(Arr, iStart, iMid, iEnd);
+        }
+    }
+}

dancealgorithm/assignments/MS - Customer/__init__.py

@@ -0,0 +1,34 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "MS - Customer"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")

dancealgorithm/assignments/MS - Customer/dataset.csv

@@ -0,0 +1,16 @@
+order_id,customer_name,amount,timestamp
+ORD-101,Aarav Sharma,4500,2024-01-15 10:30:00
+ORD-102,Priya Patel,2800,2024-01-12 14:20:00
+ORD-103,Rohan Verma,7200,2024-01-20 09:15:00
+ORD-104,Ananya Iyer,1500,2024-01-10 16:45:00
+ORD-105,Vikram Singh,8900,2024-01-18 11:10:00
+ORD-106,Sneha Kulkarni,3400,2024-01-14 18:25:00
+ORD-107,Aditya Nair,6100,2024-01-11 12:05:00
+ORD-108,Pooja Mehta,9500,2024-01-19 15:50:00
+ORD-109,Karan Gupta,2100,2024-01-13 17:30:00
+ORD-110,Neha Reddy,5300,2024-01-16 08:40:00
+ORD-111,Siddharth Joshi,4100,2024-01-09 13:20:00
+ORD-112,Divya Rao,7800,2024-01-17 19:15:00
+ORD-113,Amit Deshmukh,3200,2024-01-21 10:05:00
+ORD-114,Ritu Saxena,6700,2024-01-08 11:45:00
+ORD-115,Manish Pandey,4900,2024-01-22 16:00:00

dancealgorithm/assignments/MS - Library/Solution.java

@@ -0,0 +1,162 @@
+
+import java.util.*;
+import java.io.*;
+
+class Solution {
+    // 1. Main Function
+    // Initially created the main function as the entry point.
+
+    public static void main(String A[]) {
+        int iSize = 0;
+
+        // 6. Main Logic
+        // Read the dataset, basort books and display results.
+
+        try {
+            // 6.1 Count Number of Books
+
+            BufferedReader bobj = new BufferedReader(new FileReader("dataset.csv"));
+
+            bobj.readLine(); // Skip header
+
+            while (bobj.readLine() != null) {
+                iSize++;
+            }
+
+            bobj.close();
+
+            // 6.2 Create Book Array
+
+            Book Arr[] = new Book[iSize];
+
+            // 6.3 Read Book Details
+
+            bobj = new BufferedReader(new FileReader("dataset.csv"));
+
+            bobj.readLine(); // Skip header
+
+            for (int iCnt = 0; iCnt < iSize; iCnt++) {
+                String sLine = bobj.readLine();
+                String sData[] = sLine.split(",", -1);
+
+                String sID = sData[0].trim().replace("\"", "");
+                String sName = sData[1].trim().replace("\"", "");
+                String sDeadline = sData[3].trim().replace("\"", "");
+
+                Arr[iCnt] = new Book(sID, sName, sDeadline);
+            }
+
+            bobj.close();
+
+            System.out.println("Loaded " + iSize + " book records.");
+
+            // 6.4 Call Merge Sort
+
+            MergeSort(Arr, 0, iSize - 1);
+
+            // 6.5 Display Sorted Books
+
+            System.out.println("\nBooks Sorted by Return Deadline:");
+
+            DisplayBooks(Arr);
+        } catch (Exception e) {
+            System.out.println("Error: " + e.getMessage());
+        }
+    }
+
+    // 2. Book Entity
+    // Stores book ID, title and return deadline.
+
+    static class Book {
+        String sBookID;
+        String sTitle;
+        String sDeadline;
+
+        Book(String sBookID, String sTitle, String sDeadline) {
+            this.sBookID = sBookID;
+            this.sTitle = sTitle;
+            this.sDeadline = sDeadline;
+        }
+    }
+
+    // 3. Merge Function
+    // Combines two sorted subarrays into one sorted array.
+
+    public static void Merge(Book Arr[], int iStart, int iMid, int iEnd) {
+        int iSize1 = iMid - iStart + 1;
+        int iSize2 = iEnd - iMid;
+
+        Book LeftArr[] = new Book[iSize1];
+        Book RightArr[] = new Book[iSize2];
+
+        for (int iCnt = 0; iCnt < iSize1; iCnt++) {
+            LeftArr[iCnt] = Arr[iStart + iCnt];
+        }
+
+        for (int iCnt = 0; iCnt < iSize2; iCnt++) {
+            RightArr[iCnt] = Arr[iMid + 1 + iCnt];
+        }
+
+        int i = 0;
+        int j = 0;
+        int k = iStart;
+
+        while (i < iSize1 && j < iSize2) {
+            if (LeftArr[i].sDeadline.compareTo(RightArr[j].sDeadline) <= 0) {
+                Arr[k] = LeftArr[i];
+                i++;
+            } else {
+                Arr[k] = RightArr[j];
+                j++;
+            }
+
+            k++;
+        }
+
+        while (i < iSize1) {
+            Arr[k] = LeftArr[i];
+            i++;
+            k++;
+        }
+
+        while (j < iSize2) {
+            Arr[k] = RightArr[j];
+            j++;
+            k++;
+        }
+    }
+
+    // 4. Merge Sort Function
+    // Recursively divides the array and sorts books.
+
+    public static void MergeSort(Book Arr[], int iStart, int iEnd) {
+        if (iStart < iEnd) {
+            int iMid = iStart + (iEnd - iStart) / 2;
+
+            MergeSort(Arr, iStart, iMid);
+
+            MergeSort(Arr, iMid + 1, iEnd);
+
+            Merge(Arr, iStart, iMid, iEnd);
+        }
+    }
+
+    // 5. Display Function
+    // Displays the first 10 books after sorting.
+
+    public static void DisplayBooks(Book Arr[]) {
+        System.out.printf("%-15s %-35s %-25s%n",
+                "BOOK_ID", "TITLE", "RETURN DEADLINE");
+
+        System.out.println("--------------------------------------------------------------------------");
+
+        int iLimit = Math.min(Arr.length, 10);
+
+        for (int iCnt = 0; iCnt < iLimit; iCnt++) {
+            System.out.printf("%-15s %-35s %-25s%n",
+                    Arr[iCnt].sBookID,
+                    Arr[iCnt].sTitle,
+                    Arr[iCnt].sDeadline);
+        }
+    }
+}

dancealgorithm/assignments/MS - Library/__init__.py

@@ -0,0 +1,34 @@
+from __future__ import annotations
+import sys
+from pathlib import Path
+from typing import Optional
+
+PATH = Path(__file__).resolve().parent
+DIR = PATH
+JAVA_SOLUTION = PATH / "Solution.java"
+DATASET_PATH = PATH / "dataset.csv"
+TITLE = "MS - Library"
+
+def get_code() -> str:
+    if JAVA_SOLUTION.exists():
+        return JAVA_SOLUTION.read_text(encoding="utf-8")
+    return ""
+
+def extract(destination: Optional[str | Path] = None, overwrite: bool = True) -> Path:
+    from dancealgorithm.downloader import extract_bundled
+    from dancealgorithm.config import get_destination
+    target = Path(destination) if destination else get_destination()
+    extract_bundled(target, subject_filter=TITLE, overwrite=overwrite)
+    return target / PATH.name
+
+def open_folder() -> None:
+    import os
+    if sys.platform == "win32":
+        os.system(f'explorer "{PATH}"')
+
+def __getattr__(name: str):
+    if name in ("code", "java_code", "solution_code"):
+        return get_code()
+    if name in ("path", "folder", "dir"):
+        return PATH
+    raise AttributeError(f"module {__name__!r} has no attribute {name!r}")

dancealgorithm/assignments/MS - Library/dataset.csv

@@ -0,0 +1,16 @@
+book_id,book_title,borrower,return_deadline
+BK-201,Data Structures in Java,Rahul Sen,2024-03-15
+BK-202,Algorithm Design Manual,Aditi Rao,2024-03-08
+BK-203,Operating System Concepts,Sanjay Dutt,2024-03-22
+BK-204,Database Systems,Pooja Hegde,2024-03-05
+BK-205,Computer Networks,Karan Johar,2024-03-18
+BK-206,Theory of Computation,Anil Kapoor,2024-03-11
+BK-207,Artificial Intelligence,Simran Kaur,2024-03-25
+BK-208,Software Engineering,Ravi Shastri,2024-03-02
+BK-209,Compiler Design,Divya Bharti,2024-03-14
+BK-210,Discrete Mathematics,Manoj Bajpayee,2024-03-09
+BK-211,Computer Architecture,Sunil Shetty,2024-03-20
+BK-212,Cloud Computing,Rekha Sharma,2024-03-04
+BK-213,Cyber Security,Pankaj Tripathi,2024-03-17
+BK-214,Machine Learning Basics,Alia Bhatt,2024-03-07
+BK-215,Big Data Analytics,Vijay Verma,2024-03-21

dancealgorithm/assignments/MS.txt

@@ -0,0 +1,32 @@
+==================================================
+1. MERGE SORT
+==================================================
+
+ALGORITHM:
+1. Divide the array into two halves using mid = (low + high) / 2.
+2. Recursively sort the left half.
+3. Recursively sort the right half.
+4. Create temporary arrays L[] and R[].
+5. Compare elements and copy the smaller element into the original array.
+6. Copy the remaining elements.
+7. Repeat until the complete array is sorted.
+
+RECURRENCE RELATION:
+T(n) = 2T(n/2) + O(n)
+
+RECURSIVE ANALYSIS:
+T(n) = 2T(n/2) + cn
+T(n) = 4T(n/4) + 2cn
+T(n) = 8T(n/8) + 3cn
+
+General:
+T(n) = 2^k T(n/2^k) + kcn
+
+At k = log2(n):
+T(n) = O(n log n)
+
+TIME COMPLEXITY:
+Best Case    : O(n log n)
+Average Case : O(n log n)
+Worst Case   : O(n log n)
+Space        : O(n)