Main repository for Group Project 1 for Data Structures and Algorithms (CCDSALG). This project aims to compare the efficiency and asymptotic bounds of several sorting algorithms.
-
Updated
Aug 19, 2020 - C
Main repository for Group Project 1 for Data Structures and Algorithms (CCDSALG). This project aims to compare the efficiency and asymptotic bounds of several sorting algorithms.
This repository contains the codes to calculate the autocorrelation function of the Thue-Morse sequence, the absolute sum of the autocorrelation function, and the calculation related to asymptotic bound for the absolute sum.
Add a description, image, and links to the asymptotic-bounds topic page so that developers can more easily learn about it.
To associate your repository with the asymptotic-bounds topic, visit your repo's landing page and select "manage topics."