Skip to content

Generic type implementation of an algorithms library for sorting and searching to fully understand the varying time complexity, types, definitions and nuances of sorting/searching algorithms as a whole. This is based off of STL <algorithm>

Notifications You must be signed in to change notification settings

CMilly/STL-sorting-searching

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

STL-sorting-searching

Generic type implementation of an algorithms library for sorting and searching to fully understand the varying time complexity, types, definitions and nuances of sorting/searching algorithms as a whole. This is based off of STL

Overview

While not having a formal class in Data Structures and Algorithms, I felt a sense of need to better my understanding of these concepts in recent days. Most of what was learned involving this topic was mainly through the various classes taken at university, some of which in the later focusing somewhat on this topic but never going in great detail. This being said, learning is very much two fold. Researching and studying, then implementing and analyzing. This is the approach that was taken for this project in itself

About

Generic type implementation of an algorithms library for sorting and searching to fully understand the varying time complexity, types, definitions and nuances of sorting/searching algorithms as a whole. This is based off of STL <algorithm>

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages