feat(sort): Rewrite BigInt sort and enhance benchmark example

Implement a hybrid Radix Sort for BigInt, featuring 16-bit radix passes, in-place partitioning for signed numbers, and an optimized fallback to integer sort.
Enhance the example application with an interactive benchmark UI, comparing various radix_pulse algorithms (signed/unsigned int, double, BigInt, parallel unsigned) against `List.sort()`.
Add `CODE_OF_CONDUCT.md` and `CONTRIBUTING.md` to establish clear community guidelines.
Update `pubspec.yaml` description and add repository/homepage metadata.
Refactor and remove outdated benchmark files and related documentation (`benchmarks/baseline.md`, `benchmarks/unsigned_sort_benchmark.dart`).
Expand comprehensive test coverage for `radixSortBigInt`.

Author: MostafaSensei106

CODE_OF_CONDUCT.md

@@ -0,0 +1,121 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, religion, or sexual identity
+and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+*   Demonstrating empathy and kindness toward other people
+*   Being respectful of differing opinions, viewpoints, and experiences
+*   Giving and gracefully accepting constructive feedback
+*   Accepting responsibility and apologizing to those affected by our mistakes,
+    and learning from the experience
+*   Focusing on what is best not just for us as individuals, but for the
+    overall community
+
+Examples of unacceptable behavior include:
+
+*   The use of sexualized language or imagery, and sexual attention or
+    advances of any kind
+*   Trolling, insulting or derogatory comments, and personal or political attacks
+*   Public or private harassment
+*   Publishing others' private information, such as a physical or email
+    address, without their explicit permission
+*   Other conduct which could reasonably be considered inappropriate in a
+    professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards and
+will take appropriate and fair corrective action in response to any behavior
+that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official e-mail address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+[INSERT CONTACT METHOD].
+All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series
+of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interaction in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or
+permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction with the
+community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 2.1, available at
+[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].
+
+[homepage]: https://www.contributor-covenant.org
+[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html

CONTRIBUTING.md

@@ -0,0 +1,30 @@
+# Contributing to Radix Pulse
+
+First off, thank you for considering contributing to Radix Pulse! It's people like you that make the open source community such a great place.
+
+## How Can I Contribute?
+
+### Reporting Bugs
+
+- **Ensure the bug was not already reported** by searching on GitHub under [Issues](https://github.com/your_org/radix_pulse/issues).
+- If you're unable to find an open issue addressing the problem, [open a new one](https://github.com/your_org/radix_pulse/issues/new). Be sure to include a **title and clear description**, as much relevant information as possible, and a **code sample** or an **executable test case** demonstrating the expected behavior that is not occurring.
+
+### Suggesting Enhancements
+
+- Open a new issue and provide a clear description of the enhancement you are suggesting.
+- Explain why this enhancement would be useful to other users.
+
+### Pull Requests
+
+1.  Fork the repo and create your branch from `main`.
+2.  Add tests for any new code you write.
+3.  Ensure the test suite passes (`dart test`).
+4.  Make sure your code lints (`dart analyze`).
+5.  Format your code (`dart format .`).
+6.  Issue that pull request!
+
+## Styleguides
+
+We use the standard `effective_dart` style guide. Please ensure your code is formatted and analyzed before submitting a pull request.
+
+We look forward to your contributions!

benchmarks/baseline.md

@@ -24,7 +24,7 @@
 <header id="title">
   <span id="sidenav-left-toggle" class="material-symbols-outlined" role="button" tabindex="0">menu</span>
   <ol class="breadcrumbs gt-separated dark hidden-xs">
-    <li class="self-crumb">radix_pulse package</li>
+    <li><a href="https://github.com/your_org/radix_pulse">radix_pulse package</a></li>
   </ol>
   <div class="self-name">radix_pulse</div>
   <form class="search navbar-right" role="search">
@@ -71,7 +71,7 @@ <h1>404: Something's gone wrong :-(</h1>
   </form>
 </header>
 <ol class="breadcrumbs gt-separated dark hidden-l" id="sidebar-nav">
-    <li class="self-crumb">radix_pulse package</li>
+    <li><a href="https://github.com/your_org/radix_pulse">radix_pulse package</a></li>
 </ol>
 
   <h5>

benchmarks/unsigned_sort_benchmark.dart

@@ -24,7 +24,7 @@
 <header id="title">
   <span id="sidenav-left-toggle" class="material-symbols-outlined" role="button" tabindex="0">menu</span>
   <ol class="breadcrumbs gt-separated dark hidden-xs">
-    <li class="self-crumb">radix_pulse package</li>
+    <li><a href="https://github.com/your_org/radix_pulse">radix_pulse package</a></li>
   </ol>
   <div class="self-name">radix_pulse</div>
   <form class="search navbar-right" role="search">
@@ -149,7 +149,7 @@ <h2>Libraries</h2>
   </form>
 </header>
 <ol class="breadcrumbs gt-separated dark hidden-l" id="sidebar-nav">
-    <li class="self-crumb">radix_pulse package</li>
+    <li><a href="https://github.com/your_org/radix_pulse">radix_pulse package</a></li>
 </ol>
 
     <h5 class="hidden-xs"><span class="package-name">radix_pulse</span> <span class="package-kind">package</span></h5>

doc/api/__404error.html

@@ -1 +1 @@
-[{"name":"radix_pulse","qualifiedName":"radix_pulse","href":"radix_pulse/","kind":9,"packageRank":0,"desc":"Support for doing something awesome."},{"name":"clearBufferPools","qualifiedName":"radix_pulse.clearBufferPools","href":"radix_pulse/clearBufferPools.html","kind":8,"packageRank":0,"desc":"A top-level function to clear all global buffer pools.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortBigInt","qualifiedName":"radix_pulse.radixSortBigInt","href":"radix_pulse/radixSortBigInt.html","kind":8,"packageRank":0,"desc":"Sorts a list of BigInts in place using Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortDouble","qualifiedName":"radix_pulse.radixSortDouble","href":"radix_pulse/radixSortDouble.html","kind":8,"packageRank":0,"desc":"Sorts a list of doubles in place using a stable Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortInt","qualifiedName":"radix_pulse.radixSortInt","href":"radix_pulse/radixSortInt.html","kind":8,"packageRank":0,"desc":"Sorts a list of integers in place using a stable Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortParallelUnsigned","qualifiedName":"radix_pulse.radixSortParallelUnsigned","href":"radix_pulse/radixSortParallelUnsigned.html","kind":8,"packageRank":0,"desc":"Sorts a list of non-negative integers in parallel using Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}}]
+[{"name":"radix_pulse","qualifiedName":"radix_pulse","href":"radix_pulse/","kind":9,"packageRank":0,"desc":"Support for doing something awesome."},{"name":"clearBufferPools","qualifiedName":"radix_pulse.clearBufferPools","href":"radix_pulse/clearBufferPools.html","kind":8,"packageRank":0,"desc":"A top-level function to clear all global buffer pools.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortBigInt","qualifiedName":"radix_pulse.radixSortBigInt","href":"radix_pulse/radixSortBigInt.html","kind":8,"packageRank":0,"desc":"Sorts a list of BigInts in place using a highly optimized, hybrid Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortDouble","qualifiedName":"radix_pulse.radixSortDouble","href":"radix_pulse/radixSortDouble.html","kind":8,"packageRank":0,"desc":"Sorts a list of doubles in place using a stable Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortInt","qualifiedName":"radix_pulse.radixSortInt","href":"radix_pulse/radixSortInt.html","kind":8,"packageRank":0,"desc":"Sorts a list of integers in place using a stable Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}},{"name":"radixSortParallelUnsigned","qualifiedName":"radix_pulse.radixSortParallelUnsigned","href":"radix_pulse/radixSortParallelUnsigned.html","kind":8,"packageRank":0,"desc":"Sorts a list of non-negative integers in parallel using Radix Sort.","enclosedBy":{"name":"radix_pulse","kind":9,"href":"radix_pulse/"}}]

doc/api/index.html

@@ -96,7 +96,7 @@ <h2>Functions</h2>
 
 </dt>
 <dd>
-  Sorts a list of BigInts in place using Radix Sort.
+  Sorts a list of BigInts in place using a highly optimized, hybrid Radix Sort.
 
 
 </dd>

doc/api/index.json

@@ -63,37 +63,52 @@ <h1><span class="kind-function">radixSortBigInt</span> function
     </section>
 
 <section class="desc markdown">
-  <p>Sorts a list of BigInts in place using Radix Sort.</p>
-<p>This implementation handles both positive and negative BigInts.
-It works by separating negative and positive numbers, sorting each group
-using an LSB-first radix sort approach, and then combining them.</p>
-<p>Note: This is a simplified implementation for demonstration and may not be as
-performant as the integer and double sorters for very large numbers.</p>
+  <p>Sorts a list of BigInts in place using a highly optimized, hybrid Radix Sort.</p>
 </section>
 
 
 
 <section class="summary source-code" id="source">
   <h2><span>Implementation</span></h2>
   <pre class="language-dart"><code class="language-dart">void radixSortBigInt(List&lt;BigInt&gt; data) {
-  if (data.length &lt; 2) {
+  final len = data.length;
+  if (len &lt; 2) {
     return;
   }
 
-  final negatives = data.where((n) =&gt; n.isNegative).toList();
-  final positives = data.where((n) =&gt; !n.isNegative).toList();
+  &#47;&#47; Fast path escape hatch: If all numbers fit in a 64-bit signed integer,
+  &#47;&#47; use the much faster integer-specific radix sort.
+  bool canUseIntSort = true;
+  for (final n in data) {
+    if (!n.isValidInt) {
+      canUseIntSort = false;
+      break;
+    }
+  }
+
+  if (canUseIntSort) {
+    final intList = data.map((e) =&gt; e.toInt()).toList();
+    radixSortInt(intList, signed: true);
+    for (var i = 0; i &lt; len; i++) {
+      data[i] = BigInt.from(intList[i]);
+    }
+    return;
+  }
 
-  &#47;&#47; Sort positive numbers ascending
-  _radixSortPositiveBigInt(positives);
+  &#47;&#47; 1. Partition the list in-place into negative and positive sections.
+  int positiveStart = _partitionInPlace(data);
 
-  &#47;&#47; Sort negative numbers by their absolute value, then reverse to get descending
-  _radixSortPositiveBigInt(negatives, sortByAbsolute: true);
-  negatives.setAll(0, negatives.reversed);
+  &#47;&#47; 2. Sort the negative part (if it exists).
+  if (positiveStart &gt; 0) {
+    &#47;&#47; Sort negatives by absolute value, then reverse the sorted slice.
+    _radixSortPositiveBigInt(data, 0, positiveStart, sortByAbsolute: true);
+    _reverse(data, 0, positiveStart);
+  }
 
-  &#47;&#47; Combine the sorted lists
-  data.clear();
-  data.addAll(negatives);
-  data.addAll(positives);
+  &#47;&#47; 3. Sort the positive part (if it exists).
+  if (positiveStart &lt; len) {
+    _radixSortPositiveBigInt(data, positiveStart, len);
+  }
 }</code></pre>
 </section>