Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Created selection sort in c #39

Closed
wants to merge 3 commits into from
Closed

Conversation

Shaleen-23
Copy link
Contributor

Implemented the selection sort algorithm in c.
Issue assigned: #36

Implemented the selection sort algorithm in c.
Updated the code according to the guidelines provided
Copy link
Owner

@khagapati-bagh khagapati-bagh left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hi @Shaleen-23

Thank you for your contribution.

Here are some comments for you

  1. Follow the contribution guide and use code formatter.
  2. Add block for every if, for, while loop
  3. Mention the time, space complexity and about n.
  4. Mention issue id in your pull request

added more description about the code.
time complexity
space complexity
@Shaleen-23 Shaleen-23 closed this Oct 7, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants