Win a copy of Kotlin in Action this week in the Kotlin forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic

algorithmic classes, and order time....  RSS feed

 
Justin Fox
Ranch Hand
Posts: 802
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
ok, i know that the simple sorts, bubble, selection, insertion

all have O(N^2) order time...

but do they also have a algorithmic class?

as in (greedy,exhaustive,dynamic,backtracking,divide and conquer)?

because the huffman code is greedy, but what would it's

order time be?

and a AVL tree (height balance binary search tree) has O(logN)

but what would its alg. class be?

im pretty sure binary search, and merge sort would be classified under

divide and conquer...

but would quicksort be under divide and conquer too?

it does separate the array into to partitions.... but it doesn't

keep doing it recursively?

and, does every sort/search have a alg. class and a order time?

thanks,
Justin
 
Justin Fox
Ranch Hand
Posts: 802
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
any help would be nice
 
It is sorta covered in the JavaRanch Style Guide.
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!