Advertisement
Guest User

Untitled

a guest
Jul 26th, 2017
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.02 KB | None | 0 0
  1. /* Name: main.cpp (CS431 Assignment 2)
  2.  * Author: Scott Giminiani
  3.  * Date: Feb 17, 2011 2:44:04 PM
  4.  * Location: /home/scott/development/workspace/CS431 Assignment 2/src/main.cpp
  5.  * Description:
  6.  */
  7.  
  8. #include <iostream>
  9. using namespace std;
  10.  
  11. int main(int argc, char* argv[]) {
  12.     int n;
  13.  
  14.     cout << "Input 'number of elements': ";
  15.     cin >> n;
  16.  
  17.     int a[n];
  18.  
  19.     for (int i = 1; i <= n; i++) {
  20.         cout << "Input 'a(i)': ";
  21.         cin >> a[i];
  22.     }
  23.  
  24.     sort(n, a);
  25.  
  26.     for (int i = 1; i <= n; i++) {
  27.         cout << a[i];
  28.     }
  29.  
  30.  
  31. }
  32.  
  33. void sort(int &n, int &a) {
  34.     int j;
  35.     //for ( j = 1; ???????????????? ;n - 1)
  36.         if (a[j] > a[j + 1]) {
  37.  
  38.  
  39.         move(a, j);
  40.  
  41.  
  42.  
  43.         }
  44.  
  45.  
  46. }
  47.  
  48. void move(int &a, int &j) {
  49.     int temp, k;
  50.  
  51.     temp = a[j + 1];
  52.     a[j + 1] = a[j];
  53.  
  54.     findkay(k, j, a, temp);
  55.  
  56.  
  57.     a[k] = temp;
  58.     return;
  59. }
  60.  
  61. void findkay(int &k, int &j, int &a, int &temp) {
  62.     int sw;
  63.     k = j;
  64.     sw = 0;
  65.     while (k > 1 && sw == 0) {
  66.         if (a[k - 1] > temp) {
  67.             a[k] = a[k - 1];
  68.             k = k - 1;
  69.         }
  70.         else {
  71.             sw = 1;
  72.         }
  73.     }
  74.     return;
  75. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement