DA03 - Important Problem Types CSC 3102 3.1 B.B. Karki, LSU...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
B.B. Karki, LSU 3.1 CSC 3102 Important Problem Types
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
B.B. Karki, LSU 3.2 CSC 3102 Numerous Problems Choosing problems Of practical importance, e.g., searching problem With interesting characteristics from theoretical research point of view, e.g., traveling salesman problem. Important problem types Sorting Searching String processing Graph problems Combinatorial problems Geometric problems Numerical problems To illustrate different methods of the algorithm analysis and algorithm design techniques.
Background image of page 2
3.3 CSC 3102 Sorting Problem How to rearrange the items of a given list in some order (say, in an ascending order) Lists of numbers, characters from an alphabet, character strings Records by schools about their students, libraries about their holdings, and companies about their employees To sort records, some information called a key (e.g., name or ID number or grade point average) is chosen: Sorting a list of keys . Sorting makes searching easier: Dictionaries, telephone books, class lists and so on are sorted. Sorting algorithms:
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.

Page1 / 9

DA03 - Important Problem Types CSC 3102 3.1 B.B. Karki, LSU...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online