buranmert

def fibonacci(n):
    if n <= 2:
        return 1
    elif n <= 0:
        return 0

    if n % 2 == 0:
        x = n/2
        return fibonacci(x) * (fibonacci(x + 1) + fibonacci(x - 1))
    else:

buranmert

def quicksort(array):
    if len(array) <= 1:
        return array
    less = []
    more = []
    equal = []
    pivot = array[len(array)/2]
    for x in array:
        if x < pivot:
            less.append(x)

buranmert

- (void)test {
  NSArray *test = @[@"ASDASD", @"BAQWEQWE", @"ASDQWEQEW", @"RTYTYERTRWEEWR", @"NBVBCVVA"];
  for (unichar i = 'a'; i <= 'z' ; i++) {
    NSPredicate *filterPredicate = [NSPredicate predicateWithBlock:^BOOL(NSString *evaluatedObject, NSDictionary *bindings) {
      return tolower([evaluatedObject characterAtIndex:0]) == i;
    }];
    NSArray *filteredArray = [test filteredArrayUsingPredicate:filterPredicate];
  }
}

buranmert

array = [1,2,3]
for x in range(len(array)-1):
    indexToSwap = x
    for y in range(x+1, len(array)):
        if array[indexToSwap] > array[y]:
            indexToSwap = y
    array[x], array[indexToSwap] = array[indexToSwap], array[x]
print array

buranmert

//
//  WVViewController.m
//  WebViewTrial
//
//  Created by Mert Buran on 11/4/13.
//  Copyright (c) 2013 Mert Buran. All rights reserved.
//

#import "WVViewController.h"