https://github.com/justehmadsaeed/algorithm-analysis

Algorithm Analysis of Insertion sort, Merge sort and Hybrid sort
https://github.com/justehmadsaeed/algorithm-analysis

algorithm-analysis algorithm-challenges complexity hybrid insertion-algorithms insertion-sort merge-sort mergesort-algorithm

Last synced: 15 days ago
JSON representation

Algorithm Analysis of Insertion sort, Merge sort and Hybrid sort

• Host: GitHub
• URL: https://github.com/justehmadsaeed/algorithm-analysis
• Owner: justEhmadSaeed
• Created: 2020-02-05T11:58:17.000Z (over 6 years ago)
• Default Branch: master
• Last Pushed: 2020-02-05T17:20:05.000Z (over 6 years ago)
• Last Synced: 2025-02-26T18:34:07.717Z (over 1 year ago)
• Topics: algorithm-analysis, algorithm-challenges, complexity, hybrid, insertion-algorithms, insertion-sort, merge-sort, mergesort-algorithm
• Language: C++
• Homepage:
• Size: 4.88 KB
• Stars: 3
• Watchers: 2
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
# Algorithm Analysis

## Insertion Sort

-   Takes n^2 time complexity to sort the Array

-   Better for small sized arrays

## Merge Sort

-   Takes n(ln(n)) time complexity to sort the Array

-   Better for large sized arrays

## Hybrid Merge Sort

-   Hybrid version of Merge and Insertion sort algorithm to provide better results and time complexity

-   Sorts large sized arrays by **Merge Sort** until **Insertion Sort** Algorithm becomes more efficient and sorts the remaining small sized arrays by insertion sort algorithm