100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
Summary CSI3105 Design and Analysis of Algorithms - Full Course Notes $10.49   Add to cart
Quickly navigate to
Preview
  2.  
  3. University Of Ottawa (U Of O )
  4.  
  5. Software Engineering
  6.  
  7. CSI3105 (CSI3105)

Summary

Summary CSI3105 Design and Analysis of Algorithms - Full Course Notes
 412 views  0 purchase
  • Course
  • CSI3105 (CSI3105)
  • Institution
  • University Of Ottawa (U Of O )
  • Book
  • Algorithms

A complete set of course notes for CSI3105 typed up and put into PDF format. The course was taught by Professor Jean-Lou De Carufel at the University of Ottawa. The notes are not just copy pasted from slides but rather go into details about the concepts and summarizes the concepts so you can under...

[Show more]

Preview 1 out of 1  pages

Document information

  • Yes
  • December 8, 2018
  • 1
  • 2018/2019
  • Summary

Subjects

  • algorithms
  • csi
  • software engineering
  • university of ottawa
  • uottawa csi
  • csi3105
  • design of algorithms
  • jean lou de carufel

Connected book

book image

Book Title:

Author(s):

  • Edition:
  • ISBN:
  • Edition:

Written for

  • University of Ottawa (U of O )
  • Software Engineering
  • CSI3105 (CSI3105)
All documents for this subject (1)

Seller

avatar-seller
zarifshahriar

Content preview

Things course is going to go over:
Course covers things like correctness of algorithms, efficiency, actual programmi
Efficiency is things like steps, number of steps, and if its optimal
How do u know if something is actually optimal?

Chapter 0: Sorting and Measurement (Big O)

Insertion sort:
You have an array of numbers that unsorted
Start at the second step then keep moving backwards if your smaller than the on
Repeat for each item
Best case: Already sorted -> (n-1) steps or about (n) steps.
Worst case: Sorted in opposite order and O(n2)

Input: An array A[1..n] of n numbers. Output: An array containing the numbe
1: for j = 2 to n do
2: key = A[j]
3: i = j − 1
4: while i > 0 and A[i] > key do
5: A[i + 1] = A[i]
6: i = i − 1
7: end while
8: A[i + 1] = key
9: end for

Trace:

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller zarifshahriar. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $10.49. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

73918 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 14 years now

Start selling
$10.49
  • (0)
  Add to cart