Skip to content

Added some useful comments for easy understanding #5

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
yashaggarwal03 wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Added some useful comments for easy understanding #5

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
612d36f
Added some useful comments for easy understanding
yashaggarwal03 Oct 2, 2020
ce0b4db
Added a header file
yashaggarwal03 Oct 7, 2020
927d925
Merge pull request #1 from yashaggarwal03/yashaggarwal03-patch-1-1
yashaggarwal03 Oct 7, 2020
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
5 changes: 4 additions & 1 deletion Array/InsertionSort.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,14 +1,17 @@
//Insertion sort
void insertionSort(int a[], int n)
{
//Nested looping is required
//while loop inside for loop
int key, i, j;
for(i = 1 ; i < n ; i++)
for(i = 1 ; i < n ; i++)
{
key = a[i];
j = i - 1;

while(j >= 0 && a[j] > key)
{
//here insertion is taking place
a[j + 1] = a[j];
j--;
}
Expand Down
1 change: 1 addition & 0 deletions Array/MaxSumSubArraySizek.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
#include <bits/stdc++.h> // It includes all necessary header files
// Max sum subarray of size k
// Time : O(n)
//Space : O(1)
Expand Down