Commit 519d37f

vil02realstealthninja

and

authored

fix: remove memory issues (TheAlgorithms#2533)

Co-authored-by: realstealthninja <68815218+realstealthninja@users.noreply.github.com>

1 parent 9e44b68 commit 519d37fCopy full SHA for 519d37f

File tree

-0

lines changed

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -27,6 +27,9 @@ int *Counting_Sort(int Arr[], int N) {`
`27`	`27`	`int *Sorted_Arr = new int[N];`
`28`	`28`
`29`	`29`	`int *Count = new int[max - min + 1];`
	`30`	`+ for (int i = 0; i < max - min + 1; ++i) {`
	`31`	`+ Count[i] = 0;`
	`32`	`+ }`
`30`	`33`
`31`	`34`	`for (int i = 0; i < N; i++) Count[Arr[i] - min]++;`
`32`	`35`
`@@ -37,6 +40,7 @@ int *Counting_Sort(int Arr[], int N) {`
`37`	`40`	`Count[Arr[i] - min]--;`
`38`	`41`	`}`
`39`	`42`
	`43`	`+ delete[] Count;`
`40`	`44`	`return Sorted_Arr;`
`41`	`45`	`}`
`42`	`46`
`@@ -51,6 +55,7 @@ int main() {`
`51`	`55`	`Sorted_Arr = Counting_Sort(Arr, N);`
`52`	`56`	`cout << "\n\t Sorted Array = ";`
`53`	`57`	`Print(Sorted_Arr, N);`
	`58`	`+ delete[] Sorted_Arr;`
`54`	`59`	`cout << endl;`
`55`	`60`
`56`	`61`	`return 0;`

Comments

(0)