snippetMinor
Bubble Sort in Objective-C
Viewed 0 times
sortbubbleobjective
Problem
Following is Objective-C method implementation I did for one of the most simplest sorting algorithms, Bubble Sort to sort an array of integers.
Note:- I have defined it as a static method in the SimpleAlgorithms class.
I call this method as follows:
I know this seems to be silly for asking for improvements for something like this. But I like to find out even smallest improvements that we can made to this kind of things also because sometimes I might have done something stupid in the above implementation also. That's where we can embed power and value to the implementation.
So please give your suggestions and improvements to this Algorithm implementation.
I would be grateful if you can point out the improvements in the following areas:
Note:- I have defined it as a static method in the SimpleAlgorithms class.
/**
* When given jumbled or discending ordered array of integers, following bubble sort method will give you
* an array ordered in ascending order.
*/
+ (NSArray *) bubbleSort:(NSArray *) arrayToBeSorted {
// As we can't swap integers in a static array, make a mutable array out of the given static array.
NSMutableArray *muArrRaw = [[NSMutableArray alloc] initWithArray:arrayToBeSorted];
// iterate through the array as rounds
for (int i = 0; i [[muArrRaw objectAtIndex:(j + 1)] intValue]) {
int temp = [[muArrRaw objectAtIndex:j] intValue]; // taken the value to be swapped first
// then do the swapping
[muArrRaw replaceObjectAtIndex:j withObject:[muArrRaw objectAtIndex:(j + 1)]];
[muArrRaw replaceObjectAtIndex:(j + 1) withObject:[NSNumber numberWithInt:temp]];
}
}
}
// return the sorted array
return [muArrRaw mutableCopy];
}I call this method as follows:
NSArray *array = [[NSArray alloc] initWithObjects:[NSNumber numberWithInt:5], [NSNumber numberWithInt:3], [NSNumber numberWithInt:4], [NSNumber numberWithInt:1], [NSNumber numberWithInt:2], nil];
NSArray *sortedArray = [SimpleAlgorithms bubbleSort:array];I know this seems to be silly for asking for improvements for something like this. But I like to find out even smallest improvements that we can made to this kind of things also because sometimes I might have done something stupid in the above implementation also. That's where we can embed power and value to the implementation.
So please give your suggestions and improvements to this Algorithm implementation.
I would be grateful if you can point out the improvements in the following areas:
- Objective-C Langua
Solution
Returning a mutable copy of the temporary array makes no sense to me,
perhaps you meant
to return an immutable array (as the return type of the method indicates).
The "proper" data type for array indices is
In
you can get rid of the extra check `j
perhaps you meant
return [muArrRaw copy];to return an immutable array (as the return type of the method indicates).
The "proper" data type for array indices is
NSUInteger, not int.In
if (j [[muArrRaw objectAtIndex:(j + 1)] intValue]) {you can get rid of the extra check `j
Code Snippets
return [muArrRaw copy];if (j < ([muArrRaw count] - 1) && [[muArrRaw objectAtIndex:j] intValue] > [[muArrRaw objectAtIndex:(j + 1)] intValue]) {for (NSUInteger i = 1; i < [muArrRaw count]; i++) {
for (NSUInteger j = 0; j < [muArrRaw count] - i; j++) {
if ([muArrRaw[j] intValue] > [muArrRaw[j + 1] intValue]) {
// ...
}
}
}[muArrRaw exchangeObjectAtIndex:j withObjectAtIndex:j+1];BOOL swapped;
NSUInteger n = [muArrRaw count];
do {
swapped = NO;
for (NSUInteger j = 0; j + 1 < n; j++) {
if ([muArrRaw[j] intValue] > [muArrRaw[j + 1] intValue]) {
[muArrRaw exchangeObjectAtIndex:j withObjectAtIndex:j+1];
swapped = YES;
}
}
n--;
} while (swapped);Context
StackExchange Code Review Q#131840, answer score: 6
Revisions (0)
No revisions yet.