js-heap-data-structures/dist/types/src/utils.d.ts

A comprehensive JavaScript implementation of Min Heap and Max Heap data structures with practical utilities

/**
 * Heap Sort implementation
 * @param {Array} arr - Array to sort
 * @param {boolean} ascending - Sort in ascending order (default: true)
 * @returns {Array} Sorted array
 */
export function heapSort(arr: any[], ascending?: boolean): any[];
/**
 * Find K largest elements using Min Heap
 * @param {Array} nums - Array of numbers
 * @param {number} k - Number of largest elements to find
 * @returns {Array} K largest elements in descending order
 */
export function findKLargest(nums: any[], k: number): any[];
/**
 * Find K smallest elements using Max Heap
 * @param {Array} nums - Array of numbers
 * @param {number} k - Number of smallest elements to find
 * @returns {Array} K smallest elements in ascending order
 */
export function findKSmallest(nums: any[], k: number): any[];
/**
 * Merge K sorted arrays using Min Heap
 * @param {Array<Array>} arrays - Array of sorted arrays
 * @returns {Array} Merged sorted array
 */
export function mergeKSortedArrays(arrays: Array<any[]>): any[];
/**
 * Check if array is a valid heap
 * @param {Array} arr - Array to check
 * @param {boolean} isMinHeap - Check for min heap (default: true)
 * @returns {boolean} True if valid heap
 */
export function isValidHeap(arr: any[], isMinHeap?: boolean): boolean;