Website Summary Files Commits Branches @commit @diff @stats
diff options
context:
space:
mode:
Commit280fd038a96e0c3a75dda95f8c0c4eae07c93ce4 (patch)
Author
 Hristo Partenov <146854527+ico12319@users.noreply.github.com>
2024-10-11 12:05:44 +0300
Committer
 GitHub <noreply@github.com>
2024-10-11 12:05:44 +0300
Files6cffa7cc8432548f2286689ee2b3210195abc986
Data-structures-and-algorithms-280fd038a96e0c3a75dda95f8c0c4eae07c93ce4.tar
Data-structures-and-algorithms-280fd038a96e0c3a75dda95f8c0c4eae07c93ce4.tar.gz
Data-structures-and-algorithms-280fd038a96e0c3a75dda95f8c0c4eae07c93ce4.zip
Parentc753f8ac9ddd9d17d1b41d351abedbec74c8234c (diff)
Update insertion-sort.cpp
1 files changed, 2 insertions, 2 deletions
-rw-r--r--Seminar01/src/sorting-algorithms/insertion-sort.cpp4
diff --git a/Seminar01/src/sorting-algorithms/insertion-sort.cpp b/Seminar01/src/sorting-algorithms/insertion-sort.cpp
index 00e823e..61ca3e8 100644
--- a/Seminar01/src/sorting-algorithms/insertion-sort.cpp
+++ b/Seminar01/src/sorting-algorithms/insertion-sort.cpp
@@ -5,7 +5,7 @@ void insertionSort(T* arr, unsigned length)
{
for (size_t i = 1; i < length; i++)
{
- int elementToInsert = arr[i];
+ T elementToInsert = arr[i];
int j = i - 1;
while (j >= 0 && arr[j] > elementToInsert)
{
@@ -25,4 +25,4 @@ int main()
{
std::cout << element << " ";
}
-} \ No newline at end of file
+}