Skip to content

Haffuman.py的sort #1

Open
Open
Haffuman.py的sort#1

Description

@shawceng
shawceng
opened on May 3, 2020

每次遍历构建树都需要一次排序，排序时间复杂度为n*logn, 总时间复杂度为n^2 * logn. 这里可以采用每次合并完使用插入排序思想，以达到总体时间复杂度为n^2，望采纳[❀🐔]

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    No labels
    No labels

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions