File: qsort.cpp

package info (click to toggle)
llvm-toolchain-15 1%3A15.0.6-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 1,554,644 kB
  • sloc: cpp: 5,922,452; ansic: 1,012,136; asm: 674,362; python: 191,568; objc: 73,855; f90: 42,327; lisp: 31,913; pascal: 11,973; javascript: 10,144; sh: 9,421; perl: 7,447; ml: 5,527; awk: 3,523; makefile: 2,520; xml: 885; cs: 573; fortran: 567
file content (24 lines) | stat: -rw-r--r-- 505 bytes parent folder | download | duplicates (23) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
 
// RUN: %clangxx -O2 %s -o %t

#include <algorithm>
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <vector>

static int compare_ints(const void *a, const void *b) {
  return *(const int *)b - *(const int *)a;
}

int main() {
  std::vector<int> nums(100000);
  for (auto &n : nums)
    n = rand();

  std::vector<int> to_qsort = nums;
  qsort(to_qsort.data(), to_qsort.size(), sizeof(to_qsort[0]), &compare_ints);

  std::sort(nums.begin(), nums.end());

  assert(nums == to_qsort);
}