dancealgorithm 0.1.0__py3-none-any.whl

dancealgorithm/assignments/MSG.txt

@@ -0,0 +1,28 @@
+==================================================
+5. MULTISTAGE GRAPH (DYNAMIC PROGRAMMING)
+==================================================
+
+ALGORITHM:
+1. Represent the graph using a cost matrix.
+2. Initialize all costs to INF.
+3. Set destination cost = 0.
+4. Process vertices backwards from the last stage.
+5. Check all outgoing edges of the current vertex.
+6. Calculate the cost of every possible path.
+7. Store the minimum cost and next vertex.
+8. Follow next[] to display the optimal path.
+
+RECURRENCE RELATION:
+Cost(i) = min { C(i,j) + Cost(j) }
+
+BASE CONDITION:
+Cost(destination) = 0
+
+RECURRENCE:
+Uses iterative Dynamic Programming (backward approach).
+
+TIME COMPLEXITY:
+Best Case    : O(V^2)
+Average Case : O(V^2)
+Worst Case   : O(V^2)
+Space        : O(V) auxiliary space

dancealgorithm/assignments/QS - Commerce/Solution.java

@@ -0,0 +1,147 @@
+
+import java.util.*;
+import java.io.*;
+
+class Solution {
+    // 1. Main Function
+    // Entry point of the program.
+
+    public static void main(String A[]) {
+        int iSize = 0;
+
+        // 6. Main Logic
+        // Read product dataset, sort records and display results.
+
+        try {
+            // 6.1 Count Number of Products
+
+            BufferedReader bobj = new BufferedReader(new FileReader("dataset.csv"));
+
+            bobj.readLine(); // Skip header
+
+            while (bobj.readLine() != null) {
+                iSize++;
+            }
+
+            bobj.close();
+
+            // 6.2 Create Product Array
+
+            Product Arr[] = new Product[iSize];
+
+            // 6.3 Read Product 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 sSortKey = sData[3].trim().replace("\"", "");
+
+                Arr[iCnt] = new Product(sID, sName, sSortKey);
+            }
+
+            bobj.close();
+
+            System.out.println("Loaded " + iSize + " products.");
+
+            // 6.4 Call Quick Sort
+
+            QuickSort(Arr, 0, iSize - 1);
+
+            // 6.5 Display Top 10 Products
+
+            System.out.println("\nBest Selling Products:");
+
+            DisplayProducts(Arr);
+        } catch (Exception e) {
+            System.out.println("Error: " + e.getMessage());
+        }
+    }
+
+    // 2. Product Entity
+    // Stores product ID, name and sorting parameter.
+
+    static class Product {
+        String sProductID;
+        String sProductName;
+        String sSortKey;
+
+        Product(String sProductID, String sProductName, String sSortKey) {
+            this.sProductID = sProductID;
+            this.sProductName = sProductName;
+            this.sSortKey = sSortKey;
+        }
+    }
+
+    // 3. Swap Function
+    // Exchanges two product records in the array.
+
+    public static void Swap(Product Arr[], int iFirst, int iSecond) {
+        Product temp = Arr[iFirst];
+
+        Arr[iFirst] = Arr[iSecond];
+
+        Arr[iSecond] = temp;
+    }
+
+    // 4. Partition Function
+    // Places the pivot element at its correct position.
+
+    public static int Partition(Product Arr[], int iLow, int iHigh) {
+        double dPivot = Double.parseDouble(Arr[iHigh].sSortKey);
+
+        int i = iLow - 1;
+
+        for (int j = iLow; j < iHigh; j++) {
+            double dValue = Double.parseDouble(Arr[j].sSortKey);
+
+            if (dValue >= dPivot) {
+                i++;
+
+                Swap(Arr, i, j);
+            }
+        }
+
+        Swap(Arr, i + 1, iHigh);
+
+        return i + 1;
+    }
+
+    // 5. Quick Sort Function
+    // Recursively sorts products around the pivot element.
+
+    public static void QuickSort(Product Arr[], int iLow, int iHigh) {
+        if (iLow < iHigh) {
+            int iPivot = Partition(Arr, iLow, iHigh);
+
+            QuickSort(Arr, iLow, iPivot - 1);
+
+            QuickSort(Arr, iPivot + 1, iHigh);
+        }
+    }
+
+    // 7. Display Function
+    // Displays the first 10 products after sorting.
+
+    public static void DisplayProducts(Product Arr[]) {
+        System.out.printf("%-15s %-35s %-20s%n",
+                "PRODUCT_ID", "PRODUCT_NAME", "SALES_VOLUME");
+
+        System.out.println("--------------------------------------------------------------------------");
+
+        int iLimit = Math.min(Arr.length, 10);
+
+        for (int iCnt = 0; iCnt < iLimit; iCnt++) {
+            System.out.printf("%-15s %-35s %-20s%n",
+                    Arr[iCnt].sProductID,
+                    Arr[iCnt].sProductName,
+                    Arr[iCnt].sSortKey);
+        }
+    }
+}

dancealgorithm/assignments/QS - 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 = "QS - 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/QS - Commerce/dataset.csv

@@ -0,0 +1,16 @@
+product_id,product_title,price,sales_volume
+PRD-301,Wireless Earbuds,1999,14500
+PRD-302,Smart Fitness Watch,2499,18200
+PRD-303,Bluetooth Speaker,1499,9800
+PRD-304,Fast Charging Powerbank,1299,21500
+PRD-305,Gaming Mechanical Keyboard,3499,7600
+PRD-306,Ergonomic Optical Mouse,799,16400
+PRD-307,USB-C Multiport Hub,1199,11200
+PRD-308,Noise Cancelling Headphones,4999,8900
+PRD-309,Laptop Cooling Pad,899,13100
+PRD-310,HD Webcam 1080p,1899,15300
+PRD-311,Ring Light with Tripod,999,12400
+PRD-312,Portable SSD 1TB,6499,6200
+PRD-313,Smartphone Gimbal,5999,4800
+PRD-314,Wireless Mouse Pad,499,23000
+PRD-315,True Wireless Earphones,2999,10100

dancealgorithm/assignments/QS - Movie/Solution.java

@@ -0,0 +1,148 @@
+
+import java.util.*;
+import java.io.*;
+
+class Solution {
+    // 1. Main Function
+    // Entry point of the program.
+
+    public static void main(String A[]) {
+        int iSize = 0;
+
+        // 6. Main Logic
+        // Read movie dataset, sort records and display results.
+
+        try {
+            // 6.1 Count Number of Movies
+
+            BufferedReader bobj = new BufferedReader(new FileReader("dataset.csv"));
+
+            bobj.readLine(); // Skip header
+
+            while (bobj.readLine() != null) {
+                iSize++;
+            }
+
+            bobj.close();
+
+            // 6.2 Create Movie Array
+
+            Movie Arr[] = new Movie[iSize];
+
+            // 6.3 Read Movie 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 sSortKey = sData[3].trim().replace("\"", "");
+
+                Arr[iCnt] = new Movie(sID, sName, sSortKey);
+            }
+
+            bobj.close();
+
+            System.out.println("Loaded " + iSize + " movies.");
+
+            // 6.4 Call Quick Sort
+
+            QuickSort(Arr, 0, iSize - 1);
+
+            // 6.5 Display Top 10 Movies
+
+            System.out.println("\nMovies Sorted by Vote Count:");
+
+            DisplayMovies(Arr);
+        } catch (Exception e) {
+            System.out.println("Error: " + e.getMessage());
+        }
+    }
+
+    // 2. Movie Entity
+    // Stores movie ID, title and sorting parameter.
+
+    static class Movie {
+        String sMovieID;
+        String sTitle;
+        String sSortKey;
+
+        Movie(String sMovieID, String sTitle, String sSortKey) {
+            this.sMovieID = sMovieID;
+            this.sTitle = sTitle;
+            this.sSortKey = sSortKey;
+        }
+    }
+
+    // 3. Swap Function
+    // Exchanges two movie records in the array.
+
+    public static void Swap(Movie Arr[], int iFirst, int iSecond) {
+        Movie temp = Arr[iFirst];
+
+        Arr[iFirst] = Arr[iSecond];
+
+        Arr[iSecond] = temp;
+    }
+
+    // 4. Partition Function
+    // Places the pivot element at its correct position.
+
+    public static int Partition(Movie Arr[], int iLow, int iHigh) {
+        String sPivot = Arr[iHigh].sSortKey;
+
+        int i = iLow - 1;
+
+        for (int j = iLow; j < iHigh; j++) {
+            double dValue1 = Double.parseDouble(Arr[j].sSortKey);
+            double dValue2 = Double.parseDouble(sPivot);
+
+            if (dValue1 >= dValue2) {
+                i++;
+
+                Swap(Arr, i, j);
+            }
+        }
+
+        Swap(Arr, i + 1, iHigh);
+
+        return i + 1;
+    }
+
+    // 5. Quick Sort Function
+    // Recursively sorts movies around the pivot element.
+
+    public static void QuickSort(Movie Arr[], int iLow, int iHigh) {
+        if (iLow < iHigh) {
+            int iPivot = Partition(Arr, iLow, iHigh);
+
+            QuickSort(Arr, iLow, iPivot - 1);
+
+            QuickSort(Arr, iPivot + 1, iHigh);
+        }
+    }
+
+    // 7. Display Function
+    // Displays the first 10 movies after sorting.
+
+    public static void DisplayMovies(Movie Arr[]) {
+        System.out.printf("%-15s %-35s %-20s%n",
+                "MOVIE_ID", "TITLE", "VOTE_COUNT");
+
+        System.out.println("--------------------------------------------------------------------------");
+
+        int iLimit = Math.min(Arr.length, 10);
+
+        for (int iCnt = 0; iCnt < iLimit; iCnt++) {
+            System.out.printf("%-15s %-35s %-20s%n",
+                    Arr[iCnt].sMovieID,
+                    Arr[iCnt].sTitle,
+                    Arr[iCnt].sSortKey);
+        }
+    }
+}

dancealgorithm/assignments/QS - Movie/__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 = "QS - Movie"
+
+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/QS - Movie/dataset.csv

@@ -0,0 +1,16 @@
+movie_id,movie_title,imdb_rating,vote_count
+MOV-101,3 Idiots,8.4,41000
+MOV-102,Dangal,8.3,38500
+MOV-103,Taare Zameen Par,8.3,32000
+MOV-104,Lagaan,8.1,27000
+MOV-105,Swades,8.2,29500
+MOV-106,Chak De India,8.1,24000
+MOV-107,Gangs of Wasseypur,8.2,31000
+MOV-108,Sholay,8.1,26000
+MOV-109,Drishyam,8.2,30500
+MOV-110,Andhadhun,8.2,33000
+MOV-111,Tumbbad,8.2,28500
+MOV-112,Barfi,8.1,25500
+MOV-113,Queen,8.1,23000
+MOV-114,Zindagi Na Milegi Dobara,8.2,31500
+MOV-115,Dil Chahta Hai,8.1,26500

dancealgorithm/assignments/QS - Online/Solution.java

@@ -0,0 +1,147 @@
+
+import java.util.*;
+import java.io.*;
+
+class Solution {
+    // 1. Main Function
+    // Entry point of the program.
+
+    public static void main(String A[]) {
+        int iSize = 0;
+
+        // 6. Main Logic
+        // Read job dataset, sort records and display results.
+
+        try {
+            // 6.1 Count Number of Jobs
+
+            BufferedReader bobj = new BufferedReader(new FileReader("dataset.csv"));
+
+            bobj.readLine(); // Skip header
+
+            while (bobj.readLine() != null) {
+                iSize++;
+            }
+
+            bobj.close();
+
+            // 6.2 Create Job Array
+
+            Job Arr[] = new Job[iSize];
+
+            // 6.3 Read Job 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 sRole = sData[1].trim().replace("\"", "");
+                String sSortKey = sData[3].trim().replace("\"", "");
+
+                Arr[iCnt] = new Job(sID, sRole, sSortKey);
+            }
+
+            bobj.close();
+
+            System.out.println("Loaded " + iSize + " job postings.");
+
+            // 6.4 Call Quick Sort
+
+            QuickSort(Arr, 0, iSize - 1);
+
+            // 6.5 Display Top 10 Jobs
+
+            System.out.println("\nTop 10 Job Listings:");
+
+            DisplayJobs(Arr);
+        } catch (Exception e) {
+            System.out.println("Error: " + e.getMessage());
+        }
+    }
+
+    // 2. Job Entity
+    // Stores job ID, role and sorting parameter.
+
+    static class Job {
+        String sJobID;
+        String sRole;
+        String sSortKey;
+
+        Job(String sJobID, String sRole, String sSortKey) {
+            this.sJobID = sJobID;
+            this.sRole = sRole;
+            this.sSortKey = sSortKey;
+        }
+    }
+
+    // 3. Swap Function
+    // Exchanges two job records in the array.
+
+    public static void Swap(Job Arr[], int iFirst, int iSecond) {
+        Job temp = Arr[iFirst];
+
+        Arr[iFirst] = Arr[iSecond];
+
+        Arr[iSecond] = temp;
+    }
+
+    // 4. Partition Function
+    // Places the pivot element at its correct position.
+
+    public static int Partition(Job Arr[], int iLow, int iHigh) {
+        double dPivot = Double.parseDouble(Arr[iHigh].sSortKey);
+
+        int i = iLow - 1;
+
+        for (int j = iLow; j < iHigh; j++) {
+            double dValue = Double.parseDouble(Arr[j].sSortKey);
+
+            if (dValue >= dPivot) {
+                i++;
+
+                Swap(Arr, i, j);
+            }
+        }
+
+        Swap(Arr, i + 1, iHigh);
+
+        return i + 1;
+    }
+
+    // 5. Quick Sort Function
+    // Recursively sorts jobs around the pivot element.
+
+    public static void QuickSort(Job Arr[], int iLow, int iHigh) {
+        if (iLow < iHigh) {
+            int iPivot = Partition(Arr, iLow, iHigh);
+
+            QuickSort(Arr, iLow, iPivot - 1);
+
+            QuickSort(Arr, iPivot + 1, iHigh);
+        }
+    }
+
+    // 7. Display Function
+    // Displays the first 10 jobs after sorting.
+
+    public static void DisplayJobs(Job Arr[]) {
+        System.out.printf("%-15s %-35s %-20s%n",
+                "JOB_ID", "JOB_ROLE", "SORT_VALUE");
+
+        System.out.println("--------------------------------------------------------------------------");
+
+        int iLimit = Math.min(Arr.length, 10);
+
+        for (int iCnt = 0; iCnt < iLimit; iCnt++) {
+            System.out.printf("%-15s %-35s %-20s%n",
+                    Arr[iCnt].sJobID,
+                    Arr[iCnt].sRole,
+                    Arr[iCnt].sSortKey);
+        }
+    }
+}

dancealgorithm/assignments/QS - Online/__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 = "QS - Online"
+
+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/QS - Online/dataset.csv

@@ -0,0 +1,16 @@
+job_id,job_role,salary_lpa,applicants
+JOB-701,Software Engineer (Backend),18,3450
+JOB-702,Frontend Developer (React),14,4120
+JOB-703,Full Stack Engineer,22,2890
+JOB-704,Data Scientist (ML/AI),25,2340
+JOB-705,DevOps Engineer (Cloud),20,1850
+JOB-706,Mobile App Developer (Flutter),16,3100
+JOB-707,UI/UX Product Designer,12,3900
+JOB-708,Cyber Security Analyst,24,1420
+JOB-709,Cloud Solutions Architect,32,980
+JOB-710,QA Automation Engineer,11,4600
+JOB-711,Database Administrator,15,1750
+JOB-712,AI Research Scientist,35,820
+JOB-713,Systems Network Engineer,13,2600
+JOB-714,Product Manager,28,1250
+JOB-715,Blockchain Developer,26,1100

dancealgorithm/assignments/QS.txt

@@ -0,0 +1,33 @@
+==================================================
+2. QUICK SORT (LAST ELEMENT AS PIVOT)
+==================================================
+
+ALGORITHM:
+1. Select the last element A[high] as pivot.
+2. Initialize i = low - 1.
+3. Traverse the array using j = low to high - 1.
+4. If A[j] <= pivot, increment i and swap A[i] with A[j].
+5. Swap A[i+1] with the pivot.
+6. Return the pivot index.
+7. Recursively sort the left and right partitions.
+
+RECURRENCE RELATION:
+Best Case:
+T(n) = 2T(n/2) + O(n)
+
+Worst Case:
+T(n) = T(n-1) + O(n)
+
+RECURSIVE ANALYSIS:
+Best Case:
+T(n) = O(n log n)
+
+Worst Case:
+T(n) = n + (n-1) + (n-2) + ... + 1
+T(n) = O(n^2)
+
+TIME COMPLEXITY:
+Best Case    : O(n log n)
+Average Case : O(n log n)
+Worst Case   : O(n^2)
+Space        : O(log n) average, O(n) worst