Skip to content

Improved Documentation #1557

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.

Sign up for GitHub

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

Open
AnushkaBhardwaj15 wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Improved Documentation #1557

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
33d4430
improved readability in selection sort swap
AnushkaBhardwaj15 Jan 30, 2026
3f91377
Fixed Formatting and Comment
AnushkaBhardwaj15 Feb 9, 2026
7f19330
docs: improved selection sort function documentation
AnushkaBhardwaj15 Feb 18, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 8 additions & 4 deletions sorting/selection_sort.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,7 +9,8 @@
#include <time.h>

/**
* Swapped two numbers using pointer
* Swap two integers using pointer
*
* @param first first pointer of first number
* @param second second pointer of second number
*/
Expand All @@ -21,9 +22,12 @@ void swap(int *first, int *second)
}

/**
* Selection sort algorithm implements
* Implements the Selection Sort algorithm.
*
* @param arr array to be sorted
* @param size size of array
* @param n NUmber of elements in the array
* Time Complexity:0(n^2)
* Space Complexity: O(1)
*/
void selectionSort(int *arr, int size)
{
Expand All @@ -39,7 +43,7 @@ void selectionSort(int *arr, int size)
}
if (min_index != i)
{
swap(arr + i, arr + min_index);
swap(&arr[i], &arr[min_index]);
}
}
}
Expand Down