cs3460_ch3_Linear_Structures 美国高校《数据结构》(Data Structure),共9章 节 ,英文版.pptVIP

  • 1
  • 0
  • 约9.48千字
  • 约 34页
  • 2018-05-21 发布于天津
  • 举报

cs3460_ch3_Linear_Structures 美国高校《数据结构》(Data Structure),共9章 节 ,英文版.ppt

cs3460_ch3_Linear_Structures 美国高校《数据结构》(Data Structure),共9章 节 ,英文版.ppt

Linear Structures – Selected Topics In your Computer Science II course you learned about linear structures, such as lists, stacks, and queues Since you have learned these topics before, we will quickly review three applications: Polynomial arithmetic Radix sort Infix to Postfix Conversion There will be one programming exercise from this chapter: implementing polynomial addition using a linked list structure Polynomial Arithmetic In this application we want to represent polynomials such as: 10x3 + 5x2 + 1 3x9 – 2x5 + 11x + 5 An easy way to store this information is in an array where the index

文档评论(0)

1亿VIP精品文档

相关文档