咨询与建议

限定检索结果

文献类型

  • 1 篇 会议

馆藏范围

  • 1 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1 篇 工学
    • 1 篇 信息与通信工程
    • 1 篇 控制科学与工程
    • 1 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 1 篇 医学
    • 1 篇 公共卫生与预防医...
  • 1 篇 管理学
    • 1 篇 管理科学与工程(可...
    • 1 篇 公共管理
    • 1 篇 图书情报与档案管...

主题

  • 1 篇 counting sort
  • 1 篇 mixed numeric ar...
  • 1 篇 fractional count...
  • 1 篇 real numbers
  • 1 篇 linear-time time...
  • 1 篇 negative countin...

机构

  • 1 篇 american interna...
  • 1 篇 daffodil interna...
  • 1 篇 department of co...

作者

  • 1 篇 gomes dipta
  • 1 篇 sarker dip
  • 1 篇 hasan md. manzur...
  • 1 篇 hossain shahadat

语言

  • 1 篇 英文
检索条件"主题词=Linear-Time Time Complexity"
1 条 记 录,以下是1-10 订阅
排序:
An Efficient Integrated Negative Fractional Counting Sort Algorithm
An Efficient Integrated Negative Fractional Counting Sort Al...
收藏 引用
2024 IEEE International Conference on Computing, Applications and Systems, COMPAS 2024
作者: Sarker, Dip Gomes, Dipta Hossain, Shahadat Hasan, Md. Manzurul American International University-Bangladesh Department of Computer Science Dhaka Bangladesh Daffodil International University Department of Computer Science Dhaka Bangladesh Department of Computer Science Dhaka Bangladesh
The time complexity of the Counting Sort algorithm is linear and is famous for sorting non-negative integers (0-positive). It runs well for a possible small difference between the smallest and largest number in the in... 详细信息
来源: 评论