2. Analyze the running time of the function InsertItem shown below (sorted list). To get credit,...

   

Transcribed Image Text:

2. Analyze the running time of the function InsertItem shown below (sorted list). To get credit, you need to be as specific as possible. Void InsertItem() { Int location =0; Bool found; Found = false; While ((location <length) && !found)) { If (item info[location]) Location++; Else Found=true; } For (int index = length; index>location; index--) Info[index]-info[index-1] Info[location] item; Length++ } 2. Analyze the running time of the function InsertItem shown below (sorted list). To get credit, you need to be as specific as possible. Void InsertItem() { Int location =0; Bool found; Found = false; While ((location <length) && !found)) { If (item info[location]) Location++; Else Found=true; } For (int index = length; index>location; index--) Info[index]-info[index-1] Info[location] item; Length++ }

Answer rating: 100% (QA)

The image contains a code snippet for a function named InsertItem which is used to insert an item into a sorted list To analyze the running time of th... View the full answer