Merge Sorted Array - 88. LeetCode - C#

[@QVMaster]

Excellent explanation. I really appreciate the amazing work you do, please continue

[@TeddySmithDev]

👌👍🙏

[@JeatBunkie]

Loving this series

[@TeddySmithDev]

Thanks JeatBunkie. Good to see you again.

[@AslamNazeerShaikh]

Thanks for the video. Lots of love ❤

[@LukeAvedon]

Nice! We need more C# leetcode content.

[@TeddySmithDev]

Yooo good to see u again Luke

[@VitisCZ]

That's no pointers you're just storing indexes as integers.
My pointer solution in C was.
int *a,*b,*c;
int arr1[]={1,2,3,0,0,0};
int arr2[]={2,5,6};
c=&arr1[5];
a=&arr1[2];
b=&arr2[2];
while(a>=&arr1[0] && b>=&arr2[0]){
*c-- = *a > *b ? *a-- : *b--;
}