Click here to exit full screen mode.
Sakai works much better when JavaScript is enabled. Please enable JavaScript in your Browser.
jump to content
[c]
Sites
[w]
Tools
[l]
Syllabus
Log In
Tools list begins here
Overview
Assignments
Section Info
Sign-up
Exam Registration
Forums
Syllabus
Help
Opens in a new window
Expand/collapse tool navigation
Höhere Algorithmik W18/19
Syllabus
Content begins here
Syllabus
Link
Direct link to this tool
Short URL
https://mycampus.imp.fu-berlin.de/portal/directtool/c5c08dd8-a302-4d38-86eb-73f4c6d2d58a/
Help
Opens in a new window
Syllabus
Expand All
Collapse All
Print View
Basics. Computational model. Asymptotic notation.
Comparison-based sorting. Algorithms and lower bounds. Sorting integers.
Divide-and-conquer recurrences. Master theorem. Multiplying integers.
Linear time selection.
Quickselect: Running time O(n^2) worst case and O(n) expected
Median of Medians: Like Quickselect but we find a good pivot recursivley, worst case running time O(n)
Floyd-Rivest algorithm: Optimal randomized algorithm for finding the median
A non-trivial easy lower bound for deterministic seleciton
Dynamic programming.
Amortized analysis of algorithms. Queues and dictionaries.
Self-adjusting data structures. Union-find.
Greedy algorithms. Minimum Spanning Trees.
Shortest paths. Algorithms based on matrix multiplication.
Flows. Matching.
P, NP.
Linear programming.
Are you sure you want to delete
Title
Content
Click to add title
Start Date
End Date
Click to add start date
Click to add end date
Click to add body text
Saved
Deleted
An error occurred while saving. Refresh the page and try again.
This field is required.
Start date must be before end date.
Please select a start or end date before posting to the calendar.
Click to expand/collapse, change attachments or edit body content.
Delete
Cancel
Are you sure you want to delete
Delete Item
Delete Attachment
Add
Add and Publish
Add Item
DRAFT -
WARNING: this action cannot be undone.