100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached
logo-home
Previously searched by you
Previously searched by you
logo
WGU C949 - Searching and Sorting Algorithms Questions and Answers 100% Correct $12.99
Add to cart
Quickly navigate to
Preview
  2.  
  3. WGU C949 - Searching And Sorting Algorithms
  4.  
  5. WGU C949 - Searching and Sorting Algorithms

Exam (elaborations)

WGU C949 - Searching and Sorting Algorithms Questions and Answers 100% Correct
 0 purchase
  • Course
  • WGU C949 - Searching and Sorting Algorithms
  • Institution
  • WGU C949 - Searching And Sorting Algorithms

WGU C949 - Searching and Sorting Algorithms Questions and Answers 100% CorrectWGU C949 - Searching and Sorting Algorithms Questions and Answers 100% CorrectWGU C949 - Searching and Sorting Algorithms Questions and Answers 100% CorrectWGU C949 - Searching and Sorting Algorithms Questions and Answers...

[Show more]

Preview 3 out of 17  pages

Document information

  • October 9, 2024
  • 17
  • 2024/2025
  • Exam (elaborations)
  • Questions & answers

Subjects

  • wgu c949 searching and sorting algorithms questi
  • wgu c949 searching and sorting algorithms stuvia
  • binary search answer a faster algorithm for sear

Written for

  • WGU C949 - Searching and Sorting Algorithms
  • WGU C949 - Searching and Sorting Algorithms

Seller

avatar-seller
NursingTutor1

Reviews received

Content preview

WGU C949 - Searching and

Sorting Algorithms Questions and

Answers 100% Correct


Binary search - ANSWER-A faster algorithm for searching a list if the list's

elements are sorted and directly accessible (such as an array). Binary search

first checks the middle element of the list. If the search key is found, the

algorithm returns the matching location. If the search key is not found, the

algorithm repeats the search on the remaining left sublist (if the search key

was less than the middle element) or the remaining right sublist (if the

search key was greater than the middle element).




Binary search efficiency - ANSWER-For an N element list, the maximum

number of steps required to reduce the search space to an empty sublist is

[ log2 N ] + 1




Selection sort - ANSWER-Sorting algorithm that treats the input as two parts,

a sorted part and an unsorted part, and repeatedly selects the proper next

value to move from the unsorted part to the end of the sorted part.

,Selection sort efficiency - ANSWER-If a list has N elements, the outer loop

executes N times. For each of those N outer loop executions, the inner loop

executes an average of N/2 times. So the total number of comparisons is

proportional to N * (N/2), or O(N^2)




Selection sort (python) - ANSWER-# replace "^\.+" with space

def SelectionSort(numbers):

....for idx in range(len(numbers)):

........min_idx = idx

........for comp in range(idx+1, len(numbers)):

............if numbers[min_idx] > numbers[comp]:

................min_idx = comp

........temp = numbers[idx]

........numbers[idx] = numbers[min_idx]

........numbers[min_idx] = temp

if __name__ == "__main__":

....numlist = [ 99, 77, 33, 55, 11 ]

....print("Before: " + str(numlist))

....SelectionSort(numlist)

, ....print("After: " + str(numlist))




Binary search (python) - ANSWER-# replace "^\.+" with space

def BinarySearch(num, numbers):

....low = 0

....high = len(numbers) - 1

....mid = 0

....while low <= high:

........mid = (high + low) // 2

........if numbers[mid] < num:

............low = mid + 1

........elif numbers[mid] > num:

............high = mid - 1

........else:

............return mid

....return -1

if __name__ == "__main__":

....numlist = [ 11, 33, 55, 77, 99 ]

....for val in (11, 22, 55, 88, 99):

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

Quick and easy check-out

You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.

Focus on what matters

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller NursingTutor1. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for $12.99. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

67479 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy study notes for 15 years now

Start selling
$12.99
  • (0)
Add to cart
Added