Answer:
Satyajit Ray (1921–1992), a Bengali film director from India, is well known for his contributions to Bengali literature. He created two of the most famous characters in Feluda the sleuth, and Professor Shonku the scientist. He wrote several short novels and stories in addition to those based on these two characters. His fiction was targeted mainly at younger readers (mostly teenagers) , though it became popular among children and adults alike.

Ray during recording of his film Pather Panchali
Most of his novels and stories in Bengali have been published by Ananda Publishers, Kolkata; and most of his screenplays have been published in Bengali in the literary journal Ekshan, edited by his close friend Nirmalya Acharya. During the mid-1990s, Ray's film essays and an anthology of short stories were also published in the West. Many of the stories have been translated into English and published.
Answer:
The answer to these questions can be defined as below:
Explanation:
Question 1:
In the best case big-oh the bubble and selection sort is used, where bubble style simply swaps the items, whereas the sort of sorting takes place by choosing the element.
Question 2:
In the worst case, the merge and selection is used, where Merge-sort splits the list into two sub-lists equally and incessantly names itself in the sublists to still be sorted, whereas Heap-sort is an anti-recursive type.
Question 3:
In the worst case of swapping the bubble sort algorithm is used.
Question 4:
In sorts of swap selection, bubble, and quick sort is used.
Question 5:
Insertion sorts provide the shift sorts.
Question 6:
The best big-oh is o(n), in the worst case, best case complexity of different sorts are different.
Answer:
helps protects your data and you from viruses or bad things on the internet
Explanation:
Answer:
It depends on the size of the data structure and the algorithm used, if the data structure is small, then an ordered data is not relevant considering the choice of speed.
Explanation:
There are various data structures and algorithms. The time taken to iterate through a small unordered list or array data is relevant (a linear sort of O(n) would not be harmful), but as the size increases, the execution time increases.
So, for larger data structures, an ordered data and a more time-efficient algorithm is adopted.
Answer:
umm the first one I think..? lol
