用OC写一个算法

    

    NSMutableArray *arr=[[NSMutableArray alloc]initWithObjects:@"16",@"2",@"20",@"5",@"3",@"9",@"7",nil ];

    

    

    id temp;

 

    for (int i=0; i<[arr count]-1; i++) {

        for (int j=0; j<[arr count]-i-1; j++) {

            if ([[arr objectAtIndex:j] intValue]>[[arr objectAtIndex:j+1] intValue]) {


                temp=[arr objectAtIndex:j];

                [arr replaceObjectAtIndex:j withObject:[arr objectAtIndex:j+1]];

                [arr replaceObjectAtIndex:j+1 withObject:temp];

                

            }

        }

    }

    


NSLog(@"%@",arr);


// Objective-C code for Douglas-Peucker algorithm #import "DouglasPeucker.h" @implementation DouglasPeucker + (NSArray *)douglasPeucker:(NSArray *)points epsilon:(double)epsilon { NSUInteger count = [points count]; if (count < 3) { return points; } // Find the point with the maximum distance double dmax = 0.0; NSUInteger index = 0; NSUInteger end = count - 1; for (NSUInteger i = 1; i < end; i++) { double d = [self perpendicularDistance:[points objectAtIndex:i] start:[points objectAtIndex:0] end:[points objectAtIndex:end]]; if (d > dmax) { index = i; dmax = d; } } // If max distance is greater than epsilon, recursively simplify NSMutableArray *result = [NSMutableArray array]; if (dmax > epsilon) { NSArray *recResults1 = [self douglasPeucker:[points subarrayWithRange:NSMakeRange(0, index + 1)] epsilon:epsilon]; NSArray *recResults2 = [self douglasPeucker:[points subarrayWithRange:NSMakeRange(index, count - index)] epsilon:epsilon]; [result addObjectsFromArray:recResults1]; [result removeLastObject]; [result addObjectsFromArray:recResults2]; } else { [result addObject:[points objectAtIndex:0]]; [result addObject:[points objectAtIndex:end]]; } return result; } + (double)perpendicularDistance:(CLLocationCoordinate2D)point start:(CLLocationCoordinate2D)start end:(CLLocationCoordinate2D)end { double x = point.longitude; double y = point.latitude; double x1 = start.longitude; double y1 = start.latitude; double x2 = end.longitude; double y2 = end.latitude; double A = x - x1; double B = y - y1; double C = x2 - x1; double D = y2 - y1; double dot = A * C + B * D; double len_sq = C * C + D * D; double param = dot / len_sq; double xx, yy; if (param < 0) { xx = x1; yy = y1; } else if (param > 1) { xx = x2; yy = y2; } else { xx = x1 + param * C; yy = y1 + param * D; } double dx = x - xx; double dy = y - yy; return sqrt(dx * dx + dy * dy); } @end
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值