Algorithm算法代写代考

Algorithms Tutorial 1 Problems 1. You are given an array S of n integers and another integer x. (a) Describe an O(nlogn) algorithm (in the sense of the worst case perfor- mance) that determines whether or not there exist two elements in S whose sum is exactly x. (b) Describe an algorithm that accomplishes the

NEW SOUTH WALES Algorithms: COMP3121/9101 School of Computer Science and Engineering University of New South Wales 8. MAXIMUM FLOW COMP3121/3821/9101/9801 1 / 29 Flow Networks A flow network G = (V, E) is a directed graph in which each edge e = (u, v) ∈ E has a positive integer capacity c(u, v) > 0.

Algorithms: COMP3121/9101 Aleks Ignjatovi ́c, ignjat@cse.unsw.edu.au office: 504 (CSE building) Course Admin: Anahita Namvar, comp3121.unsw@gmail.com School of Computer Science and Engineering University of New South Wales Sydney 2. DIVIDE-AND-CONQUER COMP3121/3821/9101/9801 1 / 28 A Puzzle An old puzzle: We are given 27 coins of the same denomination; we know that one of them is counterfeit

NEW SOUTH WALES Algorithms: COMP3121/9101 School of Computer Science and Engineering University of New South Wales 9. STRING MATCHING ALGORITHMS COMP3121/3821/9101/9801 1 / 13 String Matching algorithms Assume that you want to find out if a string B = b0b1 . . . bm−1 appears as a (contiguous) substring of a much longer string A

NEW SOUTH WALES Algorithms: COMP3121/9101 School of Computer Science and Engineering University of New South Wales 10. LINEAR PROGRAMMING COMP3121/9101 1 / 18 Linear Programming problems – Example 1 Problem: You are given a list of food sources f1,f2,…,fn; for each source fi you are given: its price per gram pi; the number of calories