📄 Project Report

This repository contains an in-depth analysis of various algorithms to find the majority element in an array.

👉 Click here to view the full report (PDF)

Summary

This experiment includes performance comparisons of:

• Brute-force
• Insertion sort
• Merge sort
• Quick sort
• Divide & Conquer
• Hashing
• Boyer-Moore
• Abbasov’s Algorithm

Each algorithm is tested under various array configurations and sizes. See the PDF report for detailed analysis, graphs, and results.