From 7052aba828f4cdfc0c64f2bc89733551ce14e17e Mon Sep 17 00:00:00 2001
From: Monty <xiphmont@xiph.org>
Date: Thu, 6 Apr 2000 16:46:51 +0000
Subject: Another 'moron monty' fix; got the sort backward fixing the earlier
 comparison bug

Monty

svn path=/trunk/vorbis/; revision=310
---
 lib/lsp.c | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'lib')

diff --git a/lib/lsp.c b/lib/lsp.c
index b50d5777..959912d4 100644
--- a/lib/lsp.c
+++ b/lib/lsp.c
@@ -12,7 +12,7 @@
  ********************************************************************
 
   function: LSP (also called LSF) conversion routines
-  last mod: $Id: lsp.c,v 1.6 2000/04/06 15:01:20 xiphmont Exp $
+  last mod: $Id: lsp.c,v 1.7 2000/04/06 16:46:51 xiphmont Exp $
 
   The LSP generation code is taken (with minimal modification) from
   "On the Computation of the LSP Frequencies" by Joseph Rothweiler
@@ -101,9 +101,9 @@ static void kw(double *r,int n) {
 
 static int comp(const void *a,const void *b){
   if(*(double *)a<*(double *)b)
-    return(-1);
-  else
     return(1);
+  else
+    return(-1);
 }
 
 /* CACM algorithm 283. */
-- 
cgit v1.2.1