Update README.md

README.md

@@ -1,3 +1,47 @@
----
-license: mit
----
+---
+license: mit
+tags:
+- sorting
+- bubble_sort
+- Quick Sort
+- Merge Sort
+- Algorithm
+size_categories:
+- n<1K
+---
+---
+language: 
+  - en
+tags:
+  - sorting-algorithms
+  - benchmark
+  - computer-science
+  - performance-analysis
+task_ids:
+  - runtime-analysis
+---
+
+# Sorting Algorithms Benchmark Dataset (Array Size: 1000)
+
+A benchmark dataset comparing execution time, memory usage, and comparison counts of various sorting algorithms (Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, Heap Sort, Odd-Even Sort) on arrays of size 1000. Each algorithm was run 100 times with randomized inputs to ensure statistical significance.
+
+## Dataset Details
+
+### **Columns**
+- `run`: Trial number (1-100 per algorithm).  
+- `algorithm`: Sorting algorithm name.  
+- `array_size`: Fixed size 1000.  
+- `execution_time_ms`: Average runtime in milliseconds.  
+- `memory_usage_kb`: Memory consumed in kilobytes.  
+- `comparison_count`: Number of comparisons made.  
+
+### **Algorithms Included**
+1. **Bubble Sort**  
+2. **Selection Sort**  
+3. **Insertion Sort**  
+4. **Merge Sort**  
+5. **Quick Sort**  
+6. **Heap Sort**  
+7. **Odd-Even Sort**  
+8. **Bucket Sort** *(if applicable)*  
+9. **Shell Sort** *(if applicable)*