How can I shorten this Java code? - 


/* program sorts out name in orders first alphabetical orders .*/  package nameorder;  public class nameorder {      public static void sayname(string a, string s, string d){         system.out.println("name alphabetical order: \n1."+a+"\n"+"2."+s+"\n3."+d+"\n");      }      public static void stringorder(string ,string s ,string d){         int i= a.compareto(s) ;         int j= a.compareto(d) ;         int k= d.compareto(s) ;         int l= d.compareto(a) ;         string first="";         string second="";         string third="";             if(i<0&&j<0){                 first=a;                     if(k>0&&l>0){                         third = d;                         second = s;                     }else{                         second = d;                         third = s;                     }             }else if(i>0&&j>0){                 third=a;                     if(k<0&&l<0){                         first = d;                         second = s;                     }else{                         second = s;                         first = d;                     }             }else{                 second=a;                     if(k<0&&l<0){                         first = d;                         third = s;                     }else{                         first = s;                         third = d;                     }             }         sayname(first,second,third);         }      public static void main(string[] args) {         string ="c";         string s ="a";         string d ="h";         stringorder(a.touppercase(),s.touppercase(),d.touppercase());      }  }

i'm wondering if i'm doing right or there better shorter version this?

from perspective of "sorting 3 strings", need 3 comparisons , lose temp variables.

public static void stringorder(string a, string s, string d) {     string tmp;      if (a.compareto(s) > 0) {         tmp = a;         = s;         s = tmp;     }      if (a.compareto(d) > 0) {         tmp = a;         = d;         d = tmp;     }      if (s.compareto(d) > 0) {         tmp = s;         s = d;         d = tmp;     }      sayname(a, s, d); }

but maintainability perspective, use facilities built java sort multiple strings @ time:

public static void stringorder(string a, string s, string d) {     string [] arr = {a, s, d};     java.util.arraylist<string> list = new arraylist<string>(arrays.aslist(arr));     java.util.collections.sort(list);     sayname(list.get(0), list.get(1), list.get(2)); }

Comments

Post a Comment

Popular posts from this blog

Is there a better way to structure post methods in Class Based Views -

i'm using class based views in django , never specify url in ajax calls , omit action parameter in form because know these requests go through post method of class based view. notice view - profile page make many requests depending on user updating on page - post method become convoluted , if/else mess example: def post(self, request, *args, **kwargs): # handle user changing available date if request.post.get('availabledate') != none: self.updateavailabledate(request) return jsonresponse({'result':'success'}) if request.post.get('newprojectname') != none: creative_user = creativeuserprofile.objects.get(id = request.user.id) project = project.create_project(creative_user, request.post['newprojectname']) project.save() return jsonresponse({'projectid': project.id }) if request.post.get('projectimage') != none , request.files['file']: proj
Read more

performance - Why is XCHG reg, reg a 3 micro-op instruction on modern Intel architectures? -

i'm doing micro-optimization on performance critical part of code , came across sequence of instructions (in at&t syntax): add %rax, %rbx mov %rdx, %rax mov %rbx, %rdx i thought had use case xchg allow me shave instruction , write: add %rbx, %rax xchg %rax, %rdx however, dimay found agner fog's instruction tables , xchg 3 micro-op instruction 2 cycle latency on sandy bridge, ivy bridge, broadwell, haswell , skylake. 3 whole micro-ops , 2 cycles of latency! 3 micro-ops throws off 4-1-1-1 cadence , 2 cycle latency makes worse original in best case since last 2 instructions in original might execute in parallel. now... cpu might breaking instruction micro-ops equivalent to: mov %rax, %tmp mov %rdx, %rax mov %tmp, %rdx where tmp anonymous internal register , suppose last 2 micro-ops run in parallel latency 2 cycles. given register renaming occurs on these micro-architectures, though, doesn't make sense me done way. why wouldn't register renamer
Read more

jquery - Responsive Navbar with Sub Navbar -

good day, forgive me nav vocabulary not best. if question confusing apologize. i'm working on navigation bar needs centered on page @ 768px , above. items in nav open (or perhaps toggle) subnav lives directly below. these nav should appear centered on page. i have been able work through responsive portion of nav bar, having main items align vertically , sub nav menu of each item roll out below, , gave them indent separation. working well. however, issue not responsive side, behavior @ width greater 768px. happens toggling menu's sub navigation pushes other main items down page below sub nav. here's code: $(document).ready(function () { //stick in fixed 100% height behind navbar don't wrap $('#slide-nav.navbar-inverse').after($('<div class="inverse" id="navbar-height-col"></div>')); $('#slide-nav.navbar-default').after($('<div id="navbar-height-col"></d
Read more