Answer:
The main benefit of the ordered list is that you can apply Binary Search( O( n log n) ) to search the elements. Instead of an unordered list, you need to go through the entire list to do the search( O(n) ).
The main cost of the ordered list is that every time you insert into a sorted list, you need to do comparisons to find where to place the element( O( n log n) ). But, every time you insert into an unsorted, you don't need to find where to place the element in the list ( O(1) ). Another cost for an ordered list is where you need to delete an element, you have an extra cost rearranging the list to maintain the order.
Answer: Having the ability to change the source code to fit your needs
Explanation:
Answer:
find()
Explanation:
When dealing with MongoDB the method that needs to be used in this scenario would be the find() method. This method basically returns all of the records that exist in the collection on which it is called, if no parameter is passed. If you pass a parameter/expression then only the records that match completely the expression will be returned to the user, otherwise nothing is returned. For example, on a database (db) we would call the following
db.find() ... This will return all records
db.find({specific}) ... This will return only the records that match specific.
