CS350L Week 12
1. Sorting algorithms
Sorting algorithms are an important part of managing data.
Most sorting algorithms work by comparing the data being sorted based on a portion of the data called
CS350L week 7
An algorithmic process that a function calls itself on a smaller problem of the same type in order to
simplify the problem to a solvable state.
There are two main parts
CS350L Week 13
Quick sort and Merge sort
1. Quick sort
Sorting techniques are categorized into:
1. Internal sorting
2. External sorting
It takes the place in the main memory of a computer.
Eg: Bubble sort, Insertion sor
CS350 Data Structure final project, 2014 summer
Please follow Pattern Recognition report as reference.
Huffman encoding ()
Binary Tree or Huffman Tree ()
Spring 2014 CS350L A Midterm Exam (Total: 20 points)
1. Bubble sorting
Option 1: integer
Enter the number of elements: 7
Enter the numbers to be sorted: 45 36 76 55 93 28 17
Sorted Data: 17 28 36 45 55 76 93
How to compile and run C/C+ program
The video for set up Eclipse for C/C+ IDE :
Eclipse with CDT (C Development tool) downloads:
CS350L Week 2
Abstract data type (ADT)
1. ADT (abstract data type)
(1) A set of data values and associated operations that are precisely specified independent of any
particular implementation [http:/xlinux.nist.gov/dads/HTML/abstractData
CS350L Week 6
This structure is Linear - Sequential Access - First-in-First-out
A list structure with two access points called the front and rear.
All insertions (enqueue) occur at the rear and deletions (d