Question: Consider the following algorithm to find the minimum element in an array of number A[0,….,n]. One extra variable tmp is allocated to hold the current minimum value. Start from A[0]; "tmp" is compared against A[1], A[2], …, A[N] in order. When A[i] < tmp, tmp = A[i]. What is the expected number of times that the assignment operation tmp = A[i] is performed?

From: Algorithm Design Manual [Skiena]

Subject: Algorithm Analysis

Load Another Question

Select a Subject

Select a Subject Algorithm Analysis Arrays and Strings Bit Manipulation C and Cpp Code Quality Combinatorial Search Concurrency Data Structures Databases Design Patterns Dynamic Programming General Graph Theory Hard Java Knowledge Based Linked Lists Math and Logic Puzzles Moderate Object-Oriented Design Recursion Recursion and Dynamic Programming Soft Skills Sorting and Searching Stacks and Queues System Design and Scalability Testing Threads and Locks Trees and Graphs