Every line of 'sort 2d array python' code snippets is scanned for vulnerabilities by our powerful machine learning engine that combs millions of open source libraries, ensuring your Python code is secure.
455 def Sort(self): 456 r"""Sort(doubleArray self)""" 457 return _array.doubleArray_Sort(self)
432 @numba.jit(nopython=True) 433 def is_sorted(arr): 434 """ 435 Returns True if arr is a sorted numpy array and False otherwise. 436 """ 437 for i in range(arr.size-1): 438 if arr[i+1] < arr[i]: 439 return False 440 return True
31 def column_based_sort(array, column=0): 32 """ 33 >>> column_based_sort([(5, 1), (4, 2), (3, 0)], 1) 34 [(3, 0), (5, 1), (4, 2)] 35 """ 36 return sorted(array, key=lambda x: x[column])
6 def Sort(ARR, array_history=None, sort_seq=None): 7 """Rearranges the array, ARR, in ascending order, using the natural order.""" 8 # array_history; Used in tests. When true prints ASCII Art demonstrating the sort 9 N = len(ARR) 10 11 # 3x+1 increment sequence: [1, 4, 13, 40, 121, 364, 1093, ... 12 ha = get_sort_seq(N, sort_seq) 13 print ha 14 15 for h in reversed(ha): 16 # h-sort the array (insertion sort) 17 for i in range(h,N): 18 j = i 19 while j >= h and __lt__(ARR[j], ARR[j-h]): 20 if array_history is not None: 21 array_history.add_history(ARR, {j:'*', j-h:'*'} ) 22 _exch(ARR, j, j-h) 23 j -= h 24 assert _isHsorted(ARR, h) 25 assert _isSorted(ARR) 26 if array_history is not None: 27 array_history.add_history(ARR, None)