feat: add floor function dependency and refactor sorting logic in dsorthp

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: passed
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

---
type: pre_push_report
description: Results of running various checks prior to pushing changes.
report:
  - task: run_javascript_examples
    status: na
  - task: run_c_examples
    status: na
  - task: run_cpp_examples
    status: na
  - task: run_javascript_readme_examples
    status: na
  - task: run_c_benchmarks
    status: na
  - task: run_cpp_benchmarks
    status: na
  - task: run_fortran_benchmarks
    status: na
  - task: run_javascript_benchmarks
    status: na
  - task: run_julia_benchmarks
    status: na
  - task: run_python_benchmarks
    status: na
  - task: run_r_benchmarks
    status: na
  - task: run_javascript_tests
    status: na
---

Author: 0PrashantYadav0

lib/node_modules/@stdlib/blas/ext/base/dsorthp/manifest.json

@@ -42,6 +42,7 @@
         "@stdlib/napi/argv-double",
         "@stdlib/napi/argv-strided-float64array",
         "@stdlib/math/base/assert/is-nan",
+        "@stdlib/math/base/special/floor",
         "@stdlib/math/base/assert/is-positive-zero",
         "@stdlib/strided/base/stride2offset",
         "@stdlib/blas/base/shared"
@@ -59,6 +60,7 @@
       "libpath": [],
       "dependencies": [
         "@stdlib/math/base/assert/is-nan",
+        "@stdlib/math/base/special/floor",
         "@stdlib/math/base/assert/is-positive-zero",
         "@stdlib/strided/base/stride2offset",
         "@stdlib/blas/base/shared"
@@ -76,6 +78,7 @@
       "libpath": [],
       "dependencies": [
         "@stdlib/math/base/assert/is-nan",
+        "@stdlib/math/base/special/floor",
         "@stdlib/math/base/assert/is-positive-zero",
         "@stdlib/strided/base/stride2offset",
         "@stdlib/blas/base/shared"

lib/node_modules/@stdlib/blas/ext/base/dsorthp/src/main.c

@@ -21,6 +21,7 @@
 #include "stdlib/math/base/assert/is_nan.h"
 #include "stdlib/blas/base/shared.h"
 #include "stdlib/strided/base/stride2offset.h"
+#include "stdlib/math/base/special/floor.h"
 #include <math.h>
 
 /**
@@ -81,14 +82,17 @@ void API_SUFFIX(stdlib_strided_dsorthp_ndarray)( const CBLAS_INT N, const double
 	}
 	// For a positive stride, sorting in decreasing order is equivalent to providing a negative stride and sorting in increasing order, and, for a negative stride, sorting in decreasing order is equivalent to providing a positive stride and sorting in increasing order...
 	if ( order < 0.0 ) {
-		sx = -strideX;
+		sx = strideX * -1;
 		ox = offsetX - ( (N-1)*sx );
+	}else{
+		sx = strideX;
+		ox = offsetX;
 	}
 	// Set the initial heap size:
 	n = N;
 
 	// Specify an initial "parent" index for building the heap:
-	parent = floor( N / 2 );
+	parent = stdlib_base_floor( N / 2 );
 
 	// Continue looping until the array is sorted...
 	while ( true ) {