Data Structure - Fundamentals of Algorithm Analysis

What is the growth rate of the following method? Please tell me how to find the growth rate of this method.

int count (int [] a, int c)  { int i;   int count = 0;   for (i = 0; i < a.length; i++)     if (a[i] == c) count ++;    return count; } 

Replay

Category: algorithms Time: 2016-07-31 Views: 0

Related post

iOS development

Android development

Python development

JAVA development

Development language

PHP development

Ruby development

search

Front-end development

Database

development tools

Open Platform

Javascript development

.NET development

cloud computing

server

Copyright (C) avrocks.com, All Rights Reserved.

processed in 0.152 (s). 12 q(s)