面试的时候很多公司会要求写一个冒泡排序算法,于是用OC写了一个,代码如下所示 需要注意的事项:oc数组只能存放oc对象,因此遍历数组输出的时候,记得通过NSString对象转换成intValue #import <Foundation/Foundation.h> void bubleSort(NSMutableArray *numbers){ int i,j,count= (int)[numbers count]; for (i = 0; i < count; i++) { for (j…
//冒泡 核心代码 for (int i = 0; i < array.count - 1; i++) { int a = [array[i] intValue]; for (int j = i + 1; j < array.count; j++) { int b = [array[j] intValue]; if (a > b) { [array exchangeObjectAtIndex:i withObjectAtIndex:j]; } } }…
swift 版 var numbers = [17, 28, 36, 15, 39] print("排序前\(numbers)") for i in 0..<numbers.count - 1 { for j in 0..<numbers.count - 1 - i { if numbers[j] > numbers[j + 1] { numbers.swapAt(j, j+1) } } } print("排序后\(numbers)") OC版 N…