Answer:
The answer is option 1 arr.length.
Explanation:
In java arr.length gives the correct number of elements in the array.The length is function is only applicable for arrays.
The length() method is applicable for strings.
arr.length-1 will give 1 element less.
There is no .size for arrays in java.
So we conclude that arr.length is correct way of getting the number of elements in one dimensional array arr.
Answer:
Say you have a key in a dictionary, or a key in a 2-d list. When you insert(), you are destructively iterating the original list and modifying it to reflect the insert() component. In order for the key to get lost you would have to do say insert(len: :1) which would remove the second key and therefore cause it to get "lost" because it will be destructivsly removed from its assignment and replaced by whatever you choose to insert.
Rate positively and give brainlist
Answer:
def split(word):
return [char for char in word]
word = input("Enter a word: ")
chars = split(word)
chars.sort()
sorted = ''.join(chars)
print(sorted)
Explanation:
Here is a python solution.
Answer: Animations
Explanation:
Transitions, such as fade, can be applied to all using the command Ctrl+A.
Transitions are found under the animations Tab. Sorry about the bots.
Hope This Helped!
Answer:
the consecutive two elements and swap them based on the value which is larger if we go for ascending order
Explanation:
bubble sort compares 2 consecutive elements of the list and swap them. in one iteration one value will be placed correctly depending on the sorting order either ascending or descending
