Breaking News: Grepper is joining You.com. Read the official announcement!

inplace mergesort

Cheejyg answered on March 26, 2024 Popularity 3/10 Helpfulness 2/10

answer inplace mergesort

inplace mergesort

Comment

// https://github.com/Cheejyg/Integration-of-Mergesort-and-Insertion-Sort/blob/855867a10a2782da2fd92001fdaf3f751a18646e/Integration%20of%20Mergesort%20and%20Insertion%20Sort/Main.c#L208

void inPlaceMergeSort(Element E[], long long int first, long long int last) {
	if ((last - first) < 1) { return; }
	long long int mid = (first + last) / 2;
	inPlaceMergeSort(E, first, mid);
	inPlaceMergeSort(E, mid + 1, last);
	inPlaceMerge(E, first, mid, last);
}

void inPlaceMerge(Element E[], long long int first, long long int mid, long long int last) {
	if ((last - first) < 1) { return; }

	Element temp;
	long long int compare, indexLeft = first, indexRight = mid + 1, i;
	while (indexLeft <= mid && indexRight <= last) {
		compare = E[indexRight] - E[indexLeft];
		comparison++;
		if (compare > 0) { indexLeft++; } // left < right
		else if (compare < 0) {
			// left > right
			temp = E[indexRight++];
			for (i = ++mid; i > indexLeft; i--) {
				E[i] = E[i - 1];
			}
			E[indexLeft++] = temp;
		}
		else {
			// left = right
			if (indexLeft == mid && indexRight == last) { break; }
			temp = E[indexRight++];
			indexLeft++;
			for (i = ++mid; i > indexLeft; i--) { E[i] = E[i - 1]; }
			E[indexLeft++] = temp;
		}
	}
}

Popularity 3/10 Helpfulness 2/10 Language whatever

Source: github.com

Tags: in-place mergesort whatever

Link to this answer
Share Copy Link

Contributed on Mar 26 2024

Cheejyg

0 Answers Avg Quality 2/10

inplace mergesort

Contents

More Related Answers

inplace mergesort

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.