summaryrefslogtreecommitdiff
path: root/wk3/lect/bubble.c
blob: 3d95665666a7c99e1ebe9220d41c2b510817cc2f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
#include <cs50.h>
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main(void) {

}


/*
    look at each pair of numbers i & i +1
    if they're out of order swap them
    repeat until completely sorted

    worst sorting method
    O(n^2)
    Q(n)
*/