It D because I hade this too so it is D
One advantage of Binary Search Algorithm:
Compared to Linear search it is much faster because linear search starts its searching right from the first value but binary searches for something by splitting the array in two again and again and again.
One disadvantage of Binary Search Algorithm:
Have to be sorted, unlike linear search that doesn't have to be.
Explanation:
Both Primary Key and Candidate Key are the attributes that are used to access tuples from a table. These (Primary key and Candidate key) are also can be used to create a relationship between two tables.
- A Candidate Key can be any column or a combination of columns that can qualify as a unique key in the database. Each Candidate Key can qualify as a Primary Key.
- A Primary Key is a column or a combination of columns that uniquely identify a record. The primary key is a minimal super key, so there is one and only one primary key in any relationship.
<em> The main difference between them is that a primary key is unique but there can be many candidate keys. </em>
I hope you find this information useful and interesting! Good luck!
I'm not a hundred percent sure but maybe silverlight?
Answer:
- jersey_dict = {}
-
- for i in range(5):
- j_num = int(input("Input Jersey's number (0-99): "))
- rating = int(input("Input rating (1 - 9): "))
- jersey_dict[j_num] = rating
-
- sorted_key = []
- for i in jersey_dict.keys():
- sorted_key.append(i)
-
- sorted_key.sort()
- for i in sorted_key:
- print(str(i) + ":" + str(jersey_dict[i]))
Explanation:
Firstly, define an empty dictionary (Line 1).
Next, use a for loop to prompt user to input five Jersey's number and rating and keep the input to the dictionary (Line 3-6). Next, create a list to hold the dictionary keys (Line 8-10). Use build in method, sort to arrange the keys in the list in ascending order (Line 12 ). At last, print the dictionary element by looping over the value in the sorted_key list (Line 14-15).
