Java Algorithm Snippets

A powerful VSCode extension that provides quick access to essential Java algorithm implementations. Perfect for students, competitive programmers, and developers who need quick reference to common algorithms.

✨ Features

• 🚀 Quick insertion of algorithm code snippets
• 📚 Comprehensive collection of essential algorithms
• 🔄 Both recursive and iterative implementations
• 🎯 Clean, well-documented code
• ⚡ Optimized for performance
• 📝 Detailed comments and explanations

📋 Supported Algorithms

Basic Algorithms

• fibonacci - Fibonacci sequence implementation
• factorial - Calculate factorial of a number
• minmax - Find minimum and maximum values in an array
• sumoddeneven - Sum of first N odd/even numbers

Sorting Algorithms

• mergesort - Merge sort algorithm
• quicksort - Quick sort algorithm
• heapsort - Heap sort algorithm

Search Algorithms

• binarysearch - Binary search implementation

Graph Algorithms

• mst or prims - Prim's Minimum Spanning Tree algorithm
• kruskal - Kruskal's Minimum Spanning Tree algorithm
• dijkstra - Dijkstra's Shortest Path algorithm

Other Algorithms

• matrix - Matrix operations (addition, multiplication, transpose)
• largeintmult - Large integer multiplication
• knapsack - 0/1 Knapsack problem

🚀 Quick Start

1. Install the extension from the Visual Studio Code Marketplace
2. Open a Java file in VSCode
3. Press Ctrl+Shift+P (or Cmd+Shift+P on Mac) to open the Command Palette
4. Type "Show Algorithm" and press Enter
5. Select the algorithm you want to insert

💡 Usage Example

// After inserting the Fibonacci algorithm
public class Main {
    public static void main(String[] args) {
        int n = 10;
        System.out.println("Fibonacci(" + n + ") = " + fibonacci(n));
    }
}

🤝 Contributing

We welcome contributions! Please feel free to submit a Pull Request. For major changes, please open an issue first to discuss what you would like to change.

📝 License

This project is licensed under the MIT License - see the LICENSE file for details.

📞 Support

If you encounter any issues or have suggestions, please open an issue on our GitHub repository.