Skip to content

Latest commit

 

History

History
56 lines (36 loc) · 1.3 KB

File metadata and controls

56 lines (36 loc) · 1.3 KB

⚙️ Comprehensive Sorting Algorithm Framework

An educational project written in x86 Assembly that implements a comprehensive sorting framework with multiple algorithms.
Created as part of the Computer Organization and Assembly Language (COAL) course.


📜 Features

  • Console-based interactive framework
  • Sorting algorithms implemented:
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
  • Supports both Ascending and Descending order
  • User input for array size and elements
  • Clear and organized assembly structure using Irvine32 library

🛠️ Requirements

  • Assembler: MASM (Microsoft Macro Assembler)
  • Library: Irvine32 library
  • Platform: Windows (32-bit)

📖 Usage

1️⃣ Enter the array size and input all elements.

2️⃣ Choose a sorting algorithm:

  • Bubble Sort
  • Selection Sort
  • Insertion Sort
  • Merge Sort
  • Quick Sort

3️⃣ Select Ascending or Descending order to view results.


🎯 Learning Outcomes

  • Understanding low-level implementation of sorting algorithms

  • Hands-on experience with x86 Assembly programming

  • Working with MASM and Irvine32 library

  • Reinforcing concepts of Computer Organization and Assembly Language