feat: add C implementation for stats/base/ndarray/smediansorted

[LoayAhmed304]

Resolves #{{TODO: add issue number}}.

Description

What is the purpose of this pull request?

This pull request:

• Adds C implementation for stats/base/ndarray/smediansorted package.

Related Issues

Does this pull request have any related issues?

This pull request has the following related issues:

• #{{TODO: add related issue number}}

Questions

Any questions for reviewers of this pull request?

No.

Other

Any other information relevant to this pull request? This may include screenshots, references, and/or implementation notes.

No.

Checklist

Please ensure the following tasks are completed before submitting this pull request.

• Read, understood, and followed the contributing guidelines.

AI Assistance

When authoring the changes proposed in this PR, did you use any kind of AI assistance?

• Yes
• No

If you answered "yes" above, how did you use AI assistance?

• Code generation (e.g., when writing an implementation or fixing a bug)
• Test/benchmark generation
• Documentation (including examples)
• Research and understanding

Disclosure

If you answered "yes" to using AI assistance, please provide a short disclosure indicating how you used AI assistance. This helps reviewers determine how much scrutiny to apply when reviewing your contribution. Example disclosures: "This PR was written primarily by Claude Code." or "I consulted ChatGPT to understand the codebase, but the proposed changes were fully authored manually by myself.".

{{TODO: add disclosure if applicable}}

---

@stdlib-js/reviewers

[stdlib-bot]

Coverage Report

Package	Statements	Branches	Functions	Lines
stats/base/ndarray/smediansorted	$\color{green}170/170$ $\color{green}+0.00%$	$\color{green}7/7$ $\color{green}+0.00%$	$\color{green}2/2$ $\color{green}+0.00%$	$\color{green}170/170$ $\color{green}+0.00%$

The above coverage report was generated for the changes in this PR.

[Planeshifter]

Thanks for your PR! Left an initial round of comments.

[Sachinn-64]

Suggested change

	for ( i = 0; i < len; i++ ) {
	data[ i ] = ( rand_float() * 20000.0f ) - 10000.0f;
	}
	for ( i = 0; i < len; i++ ) {
	data[ i ] = (float)i;
	}

This implementation does not generate sorted data. Since values are assigned using a random generator, the resulting array is not guaranteed to be sorted. This PR is meant to benchmark or handle sorted input.

[LoayAhmed304]

I've implemented the suggested ndarray generation and hence removed the time.h header and the rand_double() function since we don't deal with random values anymore (check 2c9fb40 ). However, should we really implement this as you suggested or mimic benchmark.js which creates a linear space of ordered values for a given interval? I haven't found a reference C length benchmark of a sorted-input package.

[LoayAhmed304]

I've adjusted the requested changes and responded with comments with my questions. Thank you for the review 🙏 @Sachinn-64 @Planeshifter