Dataset Viewer
image
imagewidth (px) 720
1.37k
| summary
stringlengths 4
244
⌀ |
|---|---|
Discrete Mathematics Algorithms and Complexity - explains using Enumeration, Paragraph
|
|
math 224 – discrete mathematics describing an algorithm – sorting an array 0..n-1 informal description of selection sort formal description explains using enumeration, paragraph, pseudocode
|
|
Discrete Mathematics explains using Enumeration, Paragraph, Pseudocode
|
|
math 224 – discrete mathematics describing an algorithm – insertion sort array 0.. n-1 pseudo-code explains using enumeration, paragraph, pseudocode
|
|
explains using enumeration, paragraph, pseudocode
|
|
Discrete Mathematics Exponentiation aP Incremental version explains using psudocode,
|
|
Discrete Mathematics Exponentiation aP Divide-and-Conquerversion (using recursion) explains using Paragraph, and Pseudocode,
|
|
math 224 – discrete mathematics exponentiation ap the program (run time) stack explains using paragraph, pseudocode,
|
|
math 224 – discrete mathematics explains using paragraph, pseudocode
|
|
math 224 – discrete mathematics asymptotic growth of functions explains using paragraph, pseudocode
|
|
math 224 – discrete mathematics explains using enumeration, paragraph
|
|
Discrete Mathematics Polynomial Functions explains using Line graph
|
|
Discrete Mathematics Log Function explains using Line graph
|
|
math 224 – discrete mathematics evaluating algorithms and complexity explains using enumeration, paragraph
|
|
Discrete Mathematics Searching an Array explains using Paragraph, Array operation diagram
|
|
math 224 – discrete mathematics linear search of an array explains using , paragraph,
|
|
math 224 – discrete mathematics binary search of an array explains using enumeration, paragraph,
|
|
math 224 – discrete mathematics explains using paragraph
|
|
math 224 – discrete mathematics types of complexity explains using enumeration, paragraph
|
|
discrete mathematics worst-case and big-o explains using enumeration, paragraph
|
|
math 224 – discrete mathematics complexity of selection sort explains using paragraph, pseudocode
|
|
Discrete Mathematics Complexity of Selection Sort explains using Paragraph, Pseudocode, and equation
|
|
chapter 2 algorithm analysis explains using enumeration, paragraph
|
|
note: a program is written in some programming language, and does not have to be finite (e.g. an operation system). explains using enumeration, paragraph
|
|
şi what to analyze • assumptions: explains using enumeration, paragraph
|
|
şi what to analyze matrix addition (example) explains using paragraph, pseudocode
|
|
What to Analyze explains using Paragraph, Pseudocode
|
|
şi what to analyze explains using , paragraph, , diagram, drawing
|
|
§2 asymptotic notation explains using paragraph, , diagram, photograph, drawing
|
|
$2 asymptotic notation (definition] and n, such that t(n) <c f(n) for all n> ng. t (n) = 0(f (n)) if there are positive constants c %3d note: explains using enumeration, paragraph, pseudocode
|
|
Asymptotic Notation explains using Enumeration, Paragraph
|
|
$2 asymptotic notation explains using paragraph,
|
|
$2 asymptotic notation explains using paragraph, pseudocode,
|
|
Asymptotic Notation explains using Paragraph, Pseudocode
|
|
General Rules explains using Enumeration, and drawings
|
|
$2 asymptotic notation e recursions: explains using , enumeration, paragraph, pseudocode
|
|
data structure explains using paragraph
|
|
The definition of Algorithm explains using Enumeration, and Paragraph,
|
|
Selection Sort explains using Enumeration, Paragraph
|
|
selection sort algorithm explains using enumeration, paragraph, pseudocode
|
|
C++ Implementation of Selection explains using Pseudocode,
|
|
1.7.1 performance analysis explains using enumeration, paragraph
|
|
1.7.1.1 space complexity explains using enumeration, paragraph
|
|
• program 1.16 float abc(float a, float b, float c) explains using enumeration, paragraph, pseudocode
|
|
Program for float sum explains using Enumeration, and Pseudocode
|
|
• program 1.18 explains using enumeration, paragraph, pseudocode
|
|
Time Complexity explains using Enumeration, Paragraph
|
|
Asymptotic Notation explains using Enumeration, Paragraph
|
|
Definition explains using Enumeration, Paragraph, Pseudocode
|
|
Definition [Big “oh"] explains using Enumeration, and equations
|
|
note explains using enumeration, paragraph
|
|
theorem 1.2 explains using paragraph
|
|
definition [omega] explains using enumeration, paragraph
|
|
Definition explains using Enumeration, Paragraph, Equations
|
|
Definition explains using Enumeration, Paragraph, Equations
|
|
Definition [Theta] explains using Enumeration, and equation
|
|
asymptotic analysis explains using enumeration, paragraph
|
|
a simple example program 1.17 explains using enumeration, paragraph, pseudocode
|
|
an recursive example explains using paragraph, pseudocode
|
|
An example of Binary Search explains using two bullet points
|
|
idea explains using enumeration, paragraph
|
|
Iterative Binary Search explains using Pseudocode
|
|
performance analysis of iterative binary search explains using enumeration, paragraph
|
|
performance analysis of iterative binary search explains using enumeration, paragraph
|
|
Recursive Binary Search explains using Paragraph, Pseudocode
|
|
performance analysis of recursive binary search explains using enumeration, paragraph
|
|
performance analysis of iterative binary search explains using enumeration, paragraph
|
|
Title slide of performance analysis in Data Structures.
|
|
fundamental concepts explains using enumeration, paragraph
|
|
performance analysis explains using enumeration, paragraph
|
|
performance analysis explains using enumeration, paragraph
|
|
space complexity explains using enumeration, paragraph
|
|
space complexity: example explains using enumeration, paragraph, pseudocode
|
|
space complexity: example 1. algorithm sum(a[], n) explains using paragraph, pseudocode
|
|
Space Complexity example explains using Enumeration
|
|
Time Complexity explains using Enumeration, Paragraph
|
|
Time Complexity explains using Enumeration
|
|
time complexity explains using enumeration, paragraph
|
|
Time Complexity explains using Paragraph, Pseudocode, Table
|
|
time complexity: example 2 statements explains using enumeration, paragraph, pseudocode,
|
|
Performance Measurement explains using Enumeration and equation
|
|
big o notation explains using enumeration, paragraph
|
|
Big O Notation explains using Line graph
|
|
Linear scale explains using line graph
|
|
Logarithmic Scale explains using Paragraph,Line graph
|
|
explains using paragraph, pseudocode,
|
|
Big O Notation explains using Enumeration, equation
|
|
Some Results explains using Paragraph,Equations
|
|
Title page of Introduction to Analysis of Algorithms
|
|
introduction to analysis of algorithms/slide 2 introduction explains using enumeration, paragraph, pseudocode
|
|
Introduction to Analysis of Algorithms explains using Enumeration
|
|
Analysis of Algorithms example of Selection Problem explained using Enumeration
|
|
introduction to analysis of algorithms /slide 5 example: selection problem... explains using enumeration, paragraph
|
|
introduction to analysis of algorithms /slide 6 example: selection problem... explains using enumeration, paragraph
|
|
introduction to analysis of algorithms/slide 7 algorithm analysis explains using paragraph
|
|
Analysis of Algorithms explains using Enumeration, Paragraph, Pseudocode
|
|
introduction to analysis of algorithms/slide 9 worst- / average- / best-case explains using enumeration, paragraph
|
|
Running-time of algorithms explains using Paragraph, Pseudocode
|
|
introduction to analysis of algorithms/slide 11 explains using paragraph
|
|
introduction to analysis.of algorithms/slide 12 algorithm? algorithm? explains using paragraph
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 13