Skip to content
This repository was archived by the owner on May 29, 2024. It is now read-only.

Add complexity documentation in c files for quick-sort.c, selection-sort.c and merge-sort and commentary for selection-sort.c#1322

Open
MrArnaudMichel wants to merge 3 commits intoMakeContributions:mainfrom
MrArnaudMichel:main
Open

Add complexity documentation in c files for quick-sort.c, selection-sort.c and merge-sort and commentary for selection-sort.c#1322
MrArnaudMichel wants to merge 3 commits intoMakeContributions:mainfrom
MrArnaudMichel:main

Conversation

@MrArnaudMichel
Copy link

PR Checklist:

  • My submission is formatted according to the guidelines in the contributing guide
  • My addition is on refer on the language README.md file
  • My addition does not have a spelling problem
  • My submission has a proper and user-friendly description of the algorithm
  • My submission has the time complexity of the algorithm
  • My submission has sample input-output of the program (NOT FOR PYTHON)

What kind of change does this PR introduce? (check at least one)

  • Bugfix
  • New algorithm
  • Optimization in previous algorithms
  • Code style update
  • Refactor
  • Documentation
  • Other, please describe:

Briefly describe the changes in this PR

Added complexity commentary for the following C algorithms:

  • Selection Sort
  • Merge Sort
  • Quick Sort

@welcome
Copy link

welcome bot commented Mar 15, 2024

Thanks for opening this pull request! Please check out our contributing guidelines.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant