代码搜索：BuildHeap
找到约 13 项符合「BuildHeap」的源代码
代码结果 13
www.eeworm.com/read/281000/10273937
cpp fig07_10.cpp
/**
* Standard heapsort.
*/
template
void heapsort( vector & a )
{
for( int i = a.size( ) / 2; i >= 0; i-- ) /* buildHeap */
percDown( a, i, a.s
www.eeworm.com/read/266379/11229261
cpp fig07_10.cpp
/**
* Standard heapsort.
*/
template
void heapsort( vector & a )
{
for( int i = a.size( ) / 2; i >= 0; i-- ) /* buildHeap */
percDown( a, i, a.s
www.eeworm.com/read/380425/9150049
cpp heapsort.cpp
#include
#include
#define N 6
int k,j;
/*
* 建堆函数
*/
void buildHeap(int *a,int i,int n){
int tmp;
k=i;
j=2*k+1;
while(j
www.eeworm.com/read/281000/10273509
cpp fig06_14.cpp
explicit BinaryHeap( const vector & items )
: array( items.size( ) + 10 ), currentSize( items.size( ) )
{
for( int i = 0; i < items.size( ); i++ )
arr
www.eeworm.com/read/313029/13598210
cpp the improvement of heapsort.cpp
#include
#include
void main()
{int number;
coutnumber;
int *data=new int[number+1]; //运用数组指针
void input(int *,int );
www.eeworm.com/read/256861/11967784
cs heapsorter.cs
using System;
using System.Collections.Generic;
using System.Text;
namespace IAXK.Sys
{
///
/// 堆排序器
///
///
[Seria
www.eeworm.com/read/414608/11107880
cpp main.cpp
#include "Maxheap.h"
#include
using namespace std;
int main()
{
int n=200,m=100;
Object o[200];
int i,temp=0;
for(i=99;i>=0;i--)
o[i] = Object(i,i);
Maxheap h = Maxheap(o,m
www.eeworm.com/read/266379/11229037
cpp fig06_14.cpp
explicit BinaryHeap( const vector & items )
: array( items.size( ) + 10 ), currentSize( items.size( ) )
{
for( int i = 0; i < items.size( ); i++ )
arr
www.eeworm.com/read/380435/9149771
cpp sort_heap.cpp
#include
#include "data.h"
//Heapify函数,s为堆长
void Heapify(int a[],int k,int s)
{
int l,largest;
l=2*k+1;
largest=k;
if(l
www.eeworm.com/read/181010/9277343
txt buildheapheapify.txt
堆排序——BuildHeap和Heapify函数的实现
网站工具
管 理
flash插件下载
早上好，认真学习啊！ 首页概论线性表栈和队列串多维数组广义表树图排序查找文件
排序基本概念