Guys I need some help building a non-recursive merge and quick sort. If anyone can help me out, that would be great. Thanks

Bottom up Variant of merge sort found HERE

Quick sort im not sure, but you can probably google something.

Why u need to do a non-recrusive quick sort and merge sort since these algorithm make use of stack memory /

For a cs153 assignment we were asked to code a binary search, sequential search, bubble sort, insertion sort, and selection sort. On top of all that we were asked to code a quick sort (w/ two stack, first and last) and a merge sort (w/ four stacks, Merge First, Merge Last, Sort First, Sort Last). Both merge and quick were supposed to be non-recursive because we haven't been taught recursive yet.