Selection sort works by picking the smallest number from the list and placing it at the front. This process is repeated for the second position towards the end of the list. It is the simplest sort algorithm.
Can someone share the C code for selection or bubble sort for string. String comparison should be based on dictionary comparison.
both seems to be same, can someone explain the difference with example and complexity?
1) Implement both algorithms 2) Test both on three cases of data: a) sorted in increase order, b) sorted in decrease order, c) randomly 3) Use data of different sizes: 10000, 100000, 1000000.
I went through 36.331 spec, there are various terms such as Srxlev, Q-hyst and so on are used. Can someone please give a brief overview of all the terms used during the cell selection and cell re-selection procedure ?
